State complexity of prefix, suffix, bifix and infix operators on regular languages

DOI10.1007/978-3-642-14455-4_34zbMATH Open1250.68174OpenAlexW1519132497MaRDI QIDQ3584908FDOQ3584908

Authors: Elena 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

Recommendations

• State complexity of code operators
• Operational state complexity of prefix-free regular languages
• State Complexity of Basic Operations on Suffix-Free Regular Languages
• State complexity of basic operations on suffix-free regular languages
• State Complexity of Combined Operations for Prefix-Free Regular Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• State complexity of code operators
• On the decidability of infix inclusion problem
• On the decidability of infix inclusion problem
• Ideal regular languages and strongly connected synchronizing automata

This page was built for publication: State complexity of prefix, suffix, bifix and infix operators on regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584908)