The following pages link to (Q4036600):
Displayed 2 items.
- Deterministic generalized automata (Q1285583) (← links)
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\). (Q1853563) (← links)