A formal definition of bottom-up embedded push-down automata and their tabulation technique

DOI10.1007/3-540-48199-0_3MaRDI QIDQ4547840zbMATH OpenFDO

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

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

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

Cited in

(2)

• scientific article; zbMATH DE number 1962765 (Why is no real title available?)
• Tabulation of automata for tree-adjoining languages

This page was built for publication: A formal definition of bottom-up embedded push-down automata and their tabulation technique

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