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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Cadilhac, M., Finkel, A., & McKenzie, P. (2012). Unambiguous constrained automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 239–250). https://doi.org/10.1007/978-3-642-31653-1_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
