Unambiguous constrained automata

Authors:
Michaël Cadilhac;Alain Finkel;Pierre McKenzie
Affiliations:
DIRO, Université de Montréal, Montréal, Québec, Canada;LSV, ENS Cachan, CNRS, Cachan Cedex, France;DIRO, Université de Montréal, Montréal, Québec, Canada
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 6
Cited 0

On Context-Free Languages

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Extended finite automata over groups

Discrete Applied Mathematics
Elements of Automata Theory

Elements of Automata Theory
Monadic second-order logics with cardinalities

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Typed monoids: an Eilenberg-like theorem for non regular languages

CAI'11 Proceedings of the 4th international conference on Algebraic informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA. Problems decidable for deterministic CA are nonetheless shown to remain decidable for unambiguous CA, and testing for regularity is added to this set of decidable problems. Unambiguous CA are then shown incomparable with deterministic reversal-bounded machines in terms of expressivity, and a deterministic model equivalent to unambiguous CA is identified.