State Complexity of Basic Operations on Suffix-Free Regular Languages

DOI10.1007/978-3-540-74456-6_45zbMATH Open1147.68559OpenAlexW1503539558MaRDI QIDQ3525596FDOQ3525596

Kai Salomaa, Yo-Sub Han

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Square on Ideal, Closed and Free Languages
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• The state complexities of some basic operations on regular languages
• Estimation of state complexity of combined operations

This page was built for publication: State Complexity of Basic Operations on Suffix-Free Regular Languages

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