Extremal minimality conditions on automata
From MaRDI portal
Publication:441884
DOI10.1016/J.TCS.2012.03.049zbMATH Open1253.68208OpenAlexW2061771611MaRDI QIDQ441884FDOQ441884
Authors: 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
Recommendations
Cites Work
- An Introduction to Symbolic Dynamics and Coding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Slowly synchronizing automata and digraphs
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- Automata with Extremal Minimality Conditions
- A graph theoretic approach to automata minimality
- Title not available (Why is that?)
- Some remarks on automata minimality
- Never minimal automata and the rainbow bipartite subgraph problem
- On the disjunctive set problem
- Multiple-entry finite automata
- Title not available (Why is that?)
- Syntactic complexity of ideal and closed languages
- Synchronised automata
Cited In (8)
- Primitivity, uniform minimality, and state complexity of Boolean operations
- A graph theoretic approach to automata minimality
- A maxmin problem on finite automata
- Closure properties of hyper-minimized automata
- Binary and circular automata having maximal state complexity for the set of synchronizing words
- Some remarks on automata minimality
- Never minimal automata and the rainbow bipartite subgraph problem
- Automata with Extremal Minimality Conditions
This page was built for publication: Extremal minimality conditions on automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441884)
