Two-way Parikh automata with a visibly pushdown stack

DOI10.1007/978-3-030-17127-8_11MaRDI QIDQ2289072zbMATH OpenOpenAlexFDO

Authors Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot

Publication date 28 January 2020

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-17127-8_11

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Visibly pushdown automata and transducers with counters
• 2-Visibly Pushdown Automata
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Regularity Problems for Visibly Pushdown Languages
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES

Cited in

(5)

• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Remarks on Parikh-recognizable omega-languages
• History-deterministic Parikh automata
• History-deterministic Parikh automata
• Synchronization of Parikh automata

This page was built for publication: Two-way Parikh automata with a visibly pushdown stack

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