Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ICALP
2004
Springer

favoriteEmaildiscussreport

119views Programming Languages» more ICALP 2004»

Tree-Walking Automata Cannot Be Determinized

13 years 10 months ago

Tree-Walking Automata Cannot Be Determinized

Download www.infres.enst.fr

Tree-walking automata are a natural sequential model for recognizing languages of ﬁnite trees. Such automata walk around the tree and may decide in the end to accept it. It is shown that deterministic tree-walking automata are weaker than nondeterministic tree-walking automata. Key words: Tree-walking automata, deterministic tree-walking automata.

Mikolaj Bojanczyk, Thomas Colcombet

Real-time Traffic

Deterministic Tree-walking Automata | ICALP 2004 | Such Automata Walk | Theoretical Computer Science | Tree-walking Automata |

claim paper

Related Content

» On the Power of TreeWalking Automata

» Looping Caterpillars

» Robust Timed Automata

» Quantitative Languages

» Finitary languages

» A Multimode RealTime Calculus

» Access control policy combining theory meets practice

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ICALP
Authors	Mikolaj Bojanczyk, Thomas Colcombet

Comments (0)