State complexity of basic operations on suffix-free regular languages
From MaRDI portal
Publication:1029324
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
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 522835 (Why is no real title available?)
- scientific article; zbMATH DE number 1948495 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 2068872 (Why is no real title available?)
- scientific article; zbMATH DE number 2081044 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- scientific article; zbMATH DE number 1418342 (Why is no real title available?)
- scientific article; zbMATH DE number 2201361 (Why is no real title available?)
- A Survey of Regular Expressions and Their Applications
- Implementation and Application of Automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- On the state complexity of reversals of regular languages
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- State complexity of regular languages
- Succinct representation of regular languages by Boolean automata
- THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(43)- Upper bound on syntactic complexity of suffix-free languages
- Kuratowski algebras generated by factor-, subword-, and suffix-free languages
- The cut operation in subclasses of convex languages
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- State complexity of combined operations for suffix-free regular languages
- Simple regular expressions and languages
- Operational state complexity of prefix-free regular languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Networks of evolutionary processors: the power of subregular filters
- Power, positive closure, and quotients on convex languages
- Complexity of suffix-free regular languages
- State complexity of two combined operations: catenation-union and catenation-intersection
- Complexity of suffix-free regular languages
- Closure properties of subregular languages under operations
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- Nondeterministic state complexity for 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
- State complexity of basic operations on non-returning regular languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- State complexity of basic operations on non-returning regular languages
- State complexity of boundary of prefix-free regular languages
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of catenation combined with union and intersection
- State complexity of insertion
- Syntactic complexity of suffix-free languages
- Syntactic complexity of regular ideals
- Operational complexity in subregular classes
- Complexity in union-free regular languages
- The magic number problem for subregular language families
- Descriptional complexity of regular languages
- State complexity of deletion and bipolar deletion
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
- State complexity of code operators
- Complexity of left-ideal, suffix-closed and suffix-free regular languages
- Operational state complexity of subtree-free regular tree languages
- Operations on Permutation Automata
- State complexity of unambiguous operations on finite automata
- The cut operation in subclasses of convex languages (extended abstract)
- The state complexities of some basic operations on 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)
