Bounded Parikh Automata
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 boun...
| Հիմնական հեղինակներ: | , , |
|---|---|
| Ձևաչափ: | Հոդված |
| Լեզու: | English |
| Հրապարակվել է: |
Open Publishing Association
2011-08-01
|
| Շարք: | Electronic Proceedings in Theoretical Computer Science |
| Առցանց հասանելիություն: | http://arxiv.org/pdf/1108.3625v1 |