Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
From MaRDI portal
Publication:5428236
DOI10.1007/978-3-540-73208-2_25zbMath1202.68231MaRDI QIDQ5428236
No author found.
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_25
68Q45: Formal languages and automata
Related Items
Numerical modeling of the in-plane behavior of historical brick masonry walls, On the State Complexity of Complements, Stars, and Reversals of Regular Languages, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity