pith. sign in

arxiv: 1108.3625 · v1 · pith:XLSWHKCNnew · submitted 2011-08-18 · 💻 cs.FL

Bounded Parikh Automata

Micha\"el Cadilhac (DIRO , Universit\'e de Montr\'eal) , Alain Finkel (LSV , ENS Cachan & CNRS) , Pierre McKenzie (DIRO This is my paper
classification 💻 cs.FL
keywords boundedlanguagesclassparikhrecognizedautomataautomatondeterministic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.