Sciweavers

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

98

Voted

STOC
2005
ACM

85views Algorithms» more STOC 2005»

Tree-walking automata do not recognize all regular languages

16 years 3 months ago

Tree-walking automata do not recognize all regular languages

Download www.liafa.jussieu.fr

Mikolaj Bojanczyk, Thomas Colcombet

Real-time Traffic

Algorithms | STOC 2005 | Tree-walking Automata |

claim paper

Related Content

» On the Power of TreeWalking Automata

» Looping Caterpillars

» Languages Modulo Normalization

» Synchronization of Regular Automata

» Extended Temporal Logic Revisited

» Interference Automata

» TwoWay Finite Automata with a WriteOnce Track

» A Topological Approach to Recognition

» A Universal Kernel for Learning Regular Languages

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Mikolaj Bojanczyk, Thomas Colcombet

Comments (0)