Bounded Parikh Automata

Details Bounded Parikh Automata Bounded Parikh Automata

2011-08-18

arxiv.org/abs/1108.3625v1

EPTCS 63, 2011, pp. 93-102

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.13

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.

Affiliated with

Also associated with

No associations

Rating

Bounded Parikh Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounded Parikh Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Parikh Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180592