Back to Results
First PageMeta Content
Computer science / Turing machine / Binary tree / Non-deterministic Turing machine / Symbol / Computation tree / Finite-state machine / Theoretical computer science / Automata theory / Models of computation


The Complexity of Tree Transducer Output Languages Kazuhiro Inaba1 and Sebastian Maneth2,[removed]The University of Tokyo, [removed]
Add to Reading List

Document Date: 2009-11-17 09:02:22

Open Document

File Size: 115,96 KB

Share Result on Facebook

/

Facility

The University of Tokyo / University of New South Wales / /

IndustryTerm

e-th / nondeterministic algorithm / straightforward backtracking-based algorithm / /

NaturalFeature

Dt MT / /

Organization

University of Tokyo / University of New South Wales / /

Person

Sydney Abstract / /

ProgrammingLanguage

XML / /

ProvinceOrState

New South Wales / /

Region

South Wales / /

Technology

straightforward backtracking-based algorithm / Linear Space Complexity The MATCH algorithm / XML / following algorithm / Matching Algorithm / nondeterministic algorithm / /

SocialTag