Multiple-entry finite automata
From MaRDI portal
Publication:1845859
DOI10.1016/S0022-0000(74)80034-6zbMath0285.94030OpenAlexW2005776781MaRDI QIDQ1845859
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80034-6
Related Items
IN MEMORIAM CHANDRA KINTALA, On the number of active states in deterministic and nondeterministic finite automata, Quotient complexity of closed languages, Merging two hierarchies of external contextual grammars with subregular selection, Relations of contextual grammars with strictly locally testable selection languages, Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars, Extremal minimality conditions on automata, Unnamed Item, DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY, State complexity of basic language operations combined with reversal, Remarks on external contextual grammars with selection, Minimizing finite automata is computationally hard, Decision problems for convex languages, Determination of finite automata accepting subregular languages, A note on multiple-entry finite automata, On the number of active states in finite automata, Equivalence problem of non-deterministic finite automata, Some remarks on multiple-entry finite automata, Characterizations for the regular prefix codes and related families, On NFAs where all states are final, initial, or both, Descriptional complexity of regular languages, Polynomial complete problems in automata theory
Cites Work
