State Complexity of Basic Operations on Suffix-Free Regular Languages
From MaRDI portal
Publication:3525596
DOI10.1007/978-3-540-74456-6_45zbMath1147.68559MaRDI QIDQ3525596
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_45
68Q45: Formal languages and automata