State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
From MaRDI portal
Publication:3584908
DOI10.1007/978-3-642-14455-4_34zbMath1250.68174MaRDI QIDQ3584908
Elena V. Pribavkina, Emanuele Rodaro
Publication date: 31 August 2010
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_34
68Q45: Formal languages and automata
Related Items
Ideal regular languages and strongly connected synchronizing automata, On the decidability of infix inclusion problem