Pages that link to "Item:Q5145316"
From MaRDI portal
The following pages link to The State Complexity of Alternating Automata (Q5145316):
Displaying 5 items.
- State complexity of reversals of deterministic finite automata with output (Q1616967) (← links)
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- Notes on counting with finite machines (Q2978526) (← links)
- Lower bounds for the state complexity of probabilistic languages and the language of prime numbers (Q5108020) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)