Extremal minimality conditions on automata

DOI10.1016/j.tcs.2012.03.049zbMath1253.68208OpenAlexW2061771611MaRDI QIDQ441884

Antonio Restivo, Roberto Vaglica

Publication date: 8 August 2012

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

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

zbMATH Keywords

deterministic finite automataminimal automataminimality problemstate-pair graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Dynamical aspects of cellular automata (37B15)

Related Items (2)

Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ Primitivity, uniform minimality, and state complexity of Boolean operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A graph theoretic approach to automata minimality
• On the disjunctive set problem
• Multiple-entry finite automata
• Automata with Extremal Minimality Conditions
• Slowly Synchronizing Automata and Digraphs
• An Introduction to Symbolic Dynamics and Coding
• Some Remarks on Automata Minimality
• Syntactic Complexity of Ideal and Closed Languages
• Never Minimal Automata and the Rainbow Bipartite Subgraph Problem
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Synchronised automata

This page was built for publication: Extremal minimality conditions on automata