Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
From MaRDI portal
Publication:5738995
DOI10.1007/978-3-319-53733-7_12zbMath1485.68138arXiv1610.00728OpenAlexW2529230500MaRDI QIDQ5738995
Corwin Sinnamon, Janusz A. Brzozowski
Publication date: 1 June 2017
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00728
regular languagetransition semigroupleft idealsuffix-freesyntactic semigroupsuffix-closeddifferent alphabetsmost complexsuffix-convexunrestricted complexityquotient/state complexity
Related Items (4)
Complexity of suffix-free regular languages ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of proper prefix-convex regular languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- On deterministic finite automata and syntactic monoid size
- Syntactic complexity of regular ideals
- State complexity of basic operations on suffix-free regular languages
- Quotient complexity of closed languages
- Quotient complexity of ideal languages
- Theory of átomata
- Quotient Complexities of Atoms in Regular Ideal Languages
- Unrestricted State Complexity of Binary Operations on Regular Languages
- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals
- Complexity of Suffix-Free Regular Languages
- Syntactic Complexity of Ideal and Closed Languages
- IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
- Implementation and Application of Automata
- COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
- Complexity of atoms, combinatorially
This page was built for publication: Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
