Tight Bounds for Cut-Operations on Deterministic Finite Automata*
From MaRDI portal
Publication:4601149
DOI10.3233/FI-2017-1577zbMath1393.68091MaRDI QIDQ4601149
Brink van der Merwe, Markus Holzer, Sebastian Jakobi, Frank Drewes
Publication date: 19 January 2018
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Related Items (3)
Operations on Permutation Automata ⋮ Operational complexity: NFA-to-DFA trade-off ⋮ Operational Accepting State Complexity: The Unary and Finite Case
This page was built for publication: Tight Bounds for Cut-Operations on Deterministic Finite Automata*