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


Foundations of Software Technology and Theoretical Computer Science (Bangalore[removed]Editors: R. Hariharan, M. Mukund, V. Vinay; pp[removed]The Complexity of Tree Transducer Output Languages Kazuhiro Inaba1 and Sebastia
Add to Reading List

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

Open Document

File Size: 434,38 KB

Share Result on Facebook

City

Bangalore / Sydney / /

Company

Creative Commons / /

/

Facility

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

IndustryTerm

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

NaturalFeature

Dt MT / /

Organization

University of Tokyo / University of New South Wales / /

Person

M. Mukund / V / /

/

ProgrammingLanguage

XML / /

ProvinceOrState

New South Wales / /

PublishedMedium

Theoretical Computer Science / /

Region

South Wales / /

Technology

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

URL

http /

SocialTag