The ranges of accepting state complexities of languages resulting from some operations

DOI10.1007/978-3-319-94812-6_17zbMath1458.68100OpenAlexW2811113775MaRDI QIDQ1616974

Markus Holzer, Michal Hospodár

Publication date: 7 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94812-6_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Operational complexity and pumping lemmas ⋮ Further Remarks on the Operational Nonterminal Complexity ⋮ On the accepting state complexity of operations on permutation automata ⋮ Unnamed Item

This page was built for publication: The ranges of accepting state complexities of languages resulting from some operations