Sciweavers

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

98

Voted

CAI
2007
Springer

88views Information Technology» more CAI 2007»

Restarting Tree Automata and Linear Context-Free Tree Languages

15 years 9 months ago

Restarting Tree Automata and Linear Context-Free Tree Languages

Download www.theory.informatik.uni-kassel.de

Heiko Stamer, Friedrich Otto

Real-time Traffic

CAI 2007 |

claim paper

Related Content

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» Natural Language Understanding by Combining Statistical Methods and Extended ContextFree G...

» Extending Stochastic ContextFree Grammars for an Application in Bioinformatics

» Recognition of Linear ContextFree Rewriting Systems

» Beyond Regularity Equational Tree Automata for Associative and Commutative Theories

» Marrying Words and Trees

» Rigid Tree Automata

» On Tree Automata that Certify Termination of LeftLinear Term Rewriting Systems

» Isomorphism of regular trees and words

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	CAI
Authors	Heiko Stamer, Friedrich Otto

Comments (0)