Back to Search
Start Over
Bounded Parikh Automata
- Source :
- EPTCS 63, 2011, pp. 93-102
- Publication Year :
- 2011
-
Abstract
- The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is the class of bounded languages whose set of iterations is semilinear.<br />Comment: In Proceedings WORDS 2011, arXiv:1108.3412
- Subjects :
- Computer Science - Formal Languages and Automata Theory
Subjects
Details
- Database :
- arXiv
- Journal :
- EPTCS 63, 2011, pp. 93-102
- Publication Type :
- Report
- Accession number :
- edsarx.1108.3625
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.4204/EPTCS.63.13