Unambiguous constrained automata

DOI10.1142/S0129054113400339zbMATH Open1293.68182OpenAlexW2163125260MaRDI QIDQ5495422FDOQ5495422

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

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400339

Recommendations

• Unambiguous constrained automata
• Unambiguous Büchi automata.
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Operations on Unambiguous Finite Automata
• Publication:4508396

zbMATH Keywords

unambiguityParikh automataregularity testconstrained automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Semigroups, Presburger formulas, and languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• On Context-Free Languages
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Extended finite automata over groups

Cited In (11)

• Unambiguous constrained automata
• On the capacity of capacitated automata
• Affine extensions of integer vector addition systems with states
• The algebraic theory of Parikh automata
• Weak cost register automata are still powerful
• Title not available (Why is that?)
• The containment problem for unambiguous register automata
• Title not available (Why is that?)
• On Synthesis of Resynchronizers for Transducers
• Unambiguity in automata theory
• Unambiguous automata

This page was built for publication: Unambiguous constrained automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495422)