Pages that link to "Item:Q5739002"
From MaRDI portal
The following pages link to Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002):
Displaying 7 items.
- Lower bound for the number of states of purposeful deterministic automata (Q796993) (← links)
- Lower bounds on the area of finite-state machines (Q1115595) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- Yet another canonical nondeterministic automaton (Q6499548) (← links)