BOUNDED PARIKH AUTOMATA
From MaRDI portal
Publication:2841977
DOI10.1142/S0129054112400709zbMath1285.68082OpenAlexW1967415065MaRDI QIDQ2841977
Pierre McKenzie, Michaël Cadilhac, Alain Finkel
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112400709
Related Items
The effect of end-markers on counter machines and commutativity, On store languages and applications, Jumping automata over Infinite words, Unboundedness problems for machines with reversal-bounded counters, Input-Position-Restricted Models of Language Acceptors, Unnamed Item, Verifying quantitative temporal properties of procedural programs, The algebraic theory of Parikh automata, Unnamed Item, Characterization and complexity results on jumping finite automata
Cites Work
- Finite-memory automata
- Well-abstracted transition systems: Application to FIFO automata.
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Model-checking CTL* over flat Presburger counter systems
- Adding nesting structure to words
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Multi-tape and infinite-state automata—a survey
- On Context-Free Languages
