scientific article; zbMATH DE number 1786544

zbMATH Open0990.68086MaRDI QIDQ4547840FDOQ4547840

Authors: Miguel A. Alonso, Eric Villemonte de la Clergerie, Manuel Vilares 

Publication date: 21 August 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2099/20990044

Title of this publication is not available (Why is that?)

Recommendations

• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Bottom-up tree pushdown automata and rewrite systems
• The bottom-up position tree automaton and its compact version
• scientific article; zbMATH DE number 1439403
• A unifying approach for multistack pushdown automata
• A Note on Pushdown Automata Systems
• Pushdown automata and context-free grammars in bisimulation semantics
• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Pushdown automata with bounded nondeterminism and bounded ambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cited In (2)

• Title not available (Why is that?)
• Tabulation of automata for tree-adjoining languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547840)