Ideal regular languages and strongly connected synchronizing automata

DOI10.1016/j.tcs.2016.09.026zbMath1453.68101OpenAlexW2529752804MaRDI QIDQ329728

Emanuele Rodaro, Rogério Reis

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.026

zbMATH Keywords

Černý's conjectureideal regular languagereset wordstrongly connected synchronizing automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Strongly connected synchronizing automata and the language of minimal reset words ⋮ Representation of (Left) Ideal Regular Languages by Synchronizing Automata ⋮ Reset complexity and completely reachable automata with simple idempotents

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronizing automata with finitely many minimal synchronizing words
• Synchronizing automata preserving a chain of partial orders
• Finitely Generated Ideal Languages and Synchronizing Automata
• Regular Ideal Languages and Synchronizing Automata
• STATE COMPLEXITY OF CODE OPERATORS
• Principal Ideal Languages and Synchronizing Automata
• Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete
• Synchronizing Automata and the Černý Conjecture
• State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
• Finitely Generated Synchronizing Automata
• On two Combinatorial Problems Arising from Automata Theory