Work

Bounded Parikh Automata

Year: 2011

Type: article

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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.63.13

Authors: Michaël Cadilhac, Alain Finkel, Pierre McKenzie

Institutions: Université de Montréal, École Normale Supérieure Paris-Saclay, Centre National de la Recherche Scientifique, Laboratoire Spécification et Vérification

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2406644087

FWCI: 0.894

Cites: 18

Cited by: 5

Related to: 20