Pages that link to "Item:Q1116710"
From MaRDI portal
The following pages link to A maxmin problem on finite automata (Q1116710):
Displayed 6 items.
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q1356504) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Separating the Classes of Recursively Enumerable Languages Based on Machine Size (Q3455749) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q5967074) (← links)