Recommendations
Cites work
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1502109 (Why is no real title available?)
- scientific article; zbMATH DE number 1747444 (Why is no real title available?)
- A graph theoretic approach to automata minimality
- An Introduction to Symbolic Dynamics and Coding
- Automata with Extremal Minimality Conditions
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- Multiple-entry finite automata
- Never minimal automata and the rainbow bipartite subgraph problem
- On the disjunctive set problem
- Slowly synchronizing automata and digraphs
- Some remarks on automata minimality
- Synchronised automata
- Syntactic complexity of ideal and closed languages
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)