DFA with a Bounded Activity Level

DOI10.1007/978-3-319-04921-2_39zbMath1362.68145OpenAlexW137446181MaRDI QIDQ5404937

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

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

Related Items (3)

Generalizations of Code Languages with Marginal Errors ⋮ Regular languages viewed from a graph-theoretic perspective ⋮ Generalizations of Code Languages with Marginal Errors

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