State Complexity of Basic Operations on Suffix-Free Regular Languages
From MaRDI portal
Publication:3525596
DOI10.1007/978-3-540-74456-6_45zbMATH Open1147.68559OpenAlexW1503539558MaRDI QIDQ3525596FDOQ3525596
Authors: Yo-Sub Han, Kai Salomaa 
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
Recommendations
- State complexity of basic operations on suffix-free regular languages
- State complexity of combined operations for suffix-free regular languages
- Nondeterministic state complexity for suffix-free regular languages
- Operational state complexity of prefix-free regular languages
- State Complexity of Combined Operations for Prefix-Free Regular Languages
Cited In (10)
- Title not available (Why is that?)
- 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
- State complexity of basic operations on suffix-free regular languages
- State complexity of code operators
- The state complexities of some basic operations on regular languages
- Simple regular expressions and languages
- Estimation of state complexity of combined operations
- State complexity of prefix, suffix, bifix and infix operators on regular languages
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)
