State complexity of basic operations on suffix-free regular languages
From MaRDI portal
Publication:1029324
DOI10.1016/j.tcs.2008.12.054zbMath1172.68033MaRDI QIDQ1029324
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.054
68Q45: Formal languages and automata