State complexity of basic operations on suffix-free regular languages
From MaRDI portal
Publication:1029324
DOI10.1016/J.TCS.2008.12.054zbMATH Open1172.68033OpenAlexW2109036808MaRDI QIDQ1029324FDOQ1029324
Authors: Yo-Sub Han, Kai Salomaa 
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.054
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- State complexity of regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the state complexity of reversals of regular languages
- Title not available (Why is that?)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Title not available (Why is that?)
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Succinct representation of regular languages by Boolean automata
- Title not available (Why is that?)
- Implementation and Application of Automata
- THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
- A Survey of Regular Expressions and Their Applications
Cited In (40)
- 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 k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of code operators
- Operational State Complexity of Subtree-Free Regular Tree Languages
- Operational state complexity of prefix-free regular languages
- Networks of evolutionary processors: the power of subregular filters
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- Upper Bound on Syntactic Complexity of Suffix-Free Languages
- The state complexities of some basic operations on regular languages
- The cut operation in subclasses of convex languages
- Syntactic complexity of regular ideals
- State complexity of deletion and bipolar deletion
- Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
- Simple regular expressions and languages
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
- Nondeterministic state complexity of star-free languages
- On external contextual grammars with subregular selection languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Power, positive closure, and quotients on convex languages
- Closure properties of subregular languages under operations
- Operational complexity in subregular classes
- The cut operation in subclasses of convex languages (extended abstract)
- Quotient complexity of closed languages
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
- Syntactic complexity of suffix-free languages
- State Complexity of Boundary of Prefix-Free Regular Languages
- Descriptional complexity of regular languages
- State Complexity of Insertion
- State complexity of unambiguous operations on finite automata
- Complexity of suffix-free regular languages
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- State complexity of catenation combined with union and intersection
- Operations on Permutation Automata
- Complexity in union-free regular languages
- The magic number problem for subregular language families
- Complexity of Suffix-Free Regular Languages
- State Complexity of Basic Operations on Suffix-Free 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 Q1029324)
