Pages that link to "Item:Q418805"
From MaRDI portal
The following pages link to A graph theoretic approach to automata minimality (Q418805):
Displaying 9 items.
- Extremal minimality conditions on automata (Q441884) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- Edge-minimization of non-deterministic finite automata (Q2761606) (← links)
- Automata with Extremal Minimality Conditions (Q3584910) (← links)
- (Q3812264) (← links)
- (Q4580203) (← links)
- (Q5109522) (← links)
- Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree (Q6133643) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)