Operational state complexity of prefix-free regular languages
From MaRDI portal
Publication:3655366
zbMATH Open1182.68105MaRDI QIDQ3655366FDOQ3655366
Authors: Yo-Sub Han, Kai Salomaa, D. Wood 
Publication date: 7 January 2010
Recommendations
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- scientific article; zbMATH DE number 7315105
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- State complexity of boundary of prefix-free regular languages
- State complexity of basic operations on suffix-free regular languages
Cited In (25)
- State complexity of combined operations for suffix-free regular languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular 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 cut operation in subclasses of convex languages
- Syntactic complexity of regular ideals
- Simple regular expressions and languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Star-Complement-Star on Prefix-Free Languages
- Power, positive closure, and quotients on convex languages
- Closure properties of subregular languages under operations
- Kleene closure and state complexity
- Prefix-free languages: left and right quotient and reversal
- Operational complexity in subregular classes
- The cut operation in subclasses of convex languages (extended abstract)
- Quotient complexity of closed languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- Kuratowski Algebras Generated by Prefix-Free Languages
- State complexity of unambiguous operations on finite automata
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
- Prefix-Free Subsets of Regular Languages and Descriptional Complexity
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Shuffled languages -- representation and recognition
- State Complexity of Basic Operations on Suffix-Free Regular Languages
This page was built for publication: Operational state complexity of prefix-free regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655366)
