Two-Way Parikh Automata

DOI10.4230/LIPICS.FSTTCS.2019.40MaRDI QIDQ5875675zbMATH OpenOpenAlexFDO

Authors Emmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1907.09362

zbMATH Keywords

Parikh automataPresburger arithmetictwo-way automata

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(13)

• Two-way two-tape automata
• Two-Way Automata in Coq
• Tropical Two-Way Automata
• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• Two Grammatical Equivalents of Flip-Pushdown Automata
• Unboundedness problems for machines with reversal-bounded counters
• Two-Way Non-Uniform Finite Automata
• Weakly-unambiguous Parikh automata and their link to holonomic series
• Remarks on Parikh-recognizable omega-languages
• History-deterministic Parikh automata
• History-deterministic Parikh automata
• The complexity of separability for semilinear sets and Parikh automata
• Two-way non-uniform finite automata

This page was built for publication: Two-Way Parikh Automata

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