Some remarks on multiple-entry finite automata

DOI10.1016/0022-0000(79)90038-2zbMath0402.68046OpenAlexW2019791627MaRDI QIDQ1255783

Paulo A. S. Veloso, Arthur Gill

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90038-2

zbMATH Keywords

NondeterminismDecision ProcedureAccepted LanguagesMultiple-Entry Finite Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

IN MEMORIAM CHANDRA KINTALA ⋮ Quotient complexity of closed languages ⋮ DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY ⋮ Decision problems for convex languages ⋮ On NFAs where all states are final, initial, or both ⋮ Descriptional complexity of regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• A note on multiple-entry finite automata
• Multiple-entry finite automata
• Ultimate-Definite and Symmetric-Definite Events and Automata