The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata

DOI10.1007/978-3-642-01748-3_8MaRDI QIDQ3630177zbMATH OpenOpenAlexFDO

Authors Yulia Dubov, Michael Kaminski

Publication date 3 June 2009

Published in Languages: From Formal to Natural (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01748-3_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Finite-memory automata with non-deterministic reassignment
• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• Context-free languages over infinite alphabets
• Finite automata over infinite alphabets: two models with transitions for local change
• Finite-memory automata

Cited in

(1)

• Finite-memory automata with non-deterministic reassignment

This page was built for publication: The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata

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