The following pages link to Multiple-entry finite automata (Q1845859):
Displayed 22 items.
- Extremal minimality conditions on automata (Q441884) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- A note on multiple-entry finite automata (Q1227703) (← links)
- Equivalence problem of non-deterministic finite automata (Q1255319) (← links)
- Some remarks on multiple-entry finite automata (Q1255783) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Polynomial complete problems in automata theory (Q1838038) (← links)
- Remarks on external contextual grammars with selection (Q1998866) (← links)
- On the number of active states in finite automata (Q2041683) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- On the number of active states in deterministic and nondeterministic finite automata (Q2399248) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- Characterizations for the regular prefix codes and related families (Q3901014) (← links)
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377) (← links)
- (Q6149979) (← links)
- Merging two hierarchies of external contextual grammars with subregular selection (Q6175098) (← links)
- Relations of contextual grammars with strictly locally testable selection languages (Q6186541) (← links)
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars (Q6204140) (← links)