DFA with a Bounded Activity Level

DOI10.1007/978-3-319-04921-2_39MaRDI QIDQ5404937zbMATH OpenOpenAlexFDO

Authors Marius Konitzer, Hans Ulrich Simon

Publication date 31 March 2014

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04921-2_39

zbMATH Keywords

computational complexityparsinglookahead DFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Deterministic finite automata with recursive calls and DPDAs
• Certifying DFA bounds for recognition and separation
• Bounded Parikh automata
• Bounded Parikh automata
• On finite automata with limited nondeterminism
• Efficient minimization of DFAs with partial transition
• On the number of active states in finite automata
• Alternating finite automata with limited universal branching
• Transition complexity of incomplete DFAs

Cited in

(3)

• Generalizations of code languages with marginal errors
• Generalizations of Code Languages with Marginal Errors
• Regular languages viewed from a graph-theoretic perspective

This page was built for publication: DFA with a Bounded Activity Level

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404937)