Descriptional Complexity of Nondeterministic Finite Automata
From MaRDI portal
Publication:5428217
DOI10.1007/978-3-540-73208-2_6zbMath1202.68239OpenAlexW1579874425MaRDI QIDQ5428217
Publication date: 28 November 2007
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_6
Related Items (6)
The tractability frontier for NFA minimization ⋮ Finite transducers and nondeterministic state complexity of regular languages ⋮ On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes ⋮ Incomplete operational transition complexity of regular languages ⋮ Nondeterministic state complexity of nested word automata ⋮ On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
This page was built for publication: Descriptional Complexity of Nondeterministic Finite Automata
