scientific article; zbMATH DE number 3353192

Cited in

(87)

State complexity of power
State complexity of unique rational operations
On the gap between separating words and separating their reversals
Power, positive closure, and quotients on convex languages
Descriptional complexity of regular languages
Commutative regular languages with product-form minimal automata
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
State complexity of union and intersection on graph-walking automata
Combination of roots and Boolean operations: an application to state complexity
Maximal state complexity and generalized de Bruijn words
State complexity of GF(2)-operations on unary languages
State complexity of permutation and related decision problems on alphabetical pattern constraints
Performing regular operations with 1-limited automata
Block reversal on finite words
Nondeterministic complexity in subclasses of convex languages
Primitivity, uniform minimality, and state complexity of Boolean operations
State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
State complexity of unambiguous operations on finite automata
On the boundary of regular languages
State complexity of permutation on finite languages over a binary alphabet
State complexity of operations on input-driven pushdown automata
Complexity of suffix-free regular languages
State complexity of pattern matching in regular languages
Counting (Watson-Crick) palindromes in Watson-Crick conjugates
Operations on Unambiguous Finite Automata
Self-verifying finite automata and descriptional complexity
The Complexity of Languages Resulting from the Concatenation Operation
Complexity of suffix-free regular languages
Kleene closure and state complexity
State complexity of catenation combined with union and intersection
Descriptional complexity of input-driven pushdown automata
Concatenation of Regular Languages and Descriptional Complexity
State complexity of cyclic shift
The Frobenius Problem and Its Generalizations
The Average State Complexity of the Star of a Finite Set of Words Is Linear
On the State Complexity of Operations on Two-Way Finite Automata
State complexity of star of union and square of union on \textit{k} regular languages
State complexity of combined operations for suffix-free regular languages
Conjunctive and Boolean grammars: the true general case of the context-free grammars
Unambiguous finite automata over a unary alphabet
State complexity of union and intersection of star on \(k\) regular languages
State complexity of the concatenation of regular tree languages
State complexity of combined operations with two basic operations
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
State complexity of operations on two-way finite automata over a unary alphabet
Operations on Unambiguous Finite Automata
A combinatorial approach for the state complexity of the shuffle product
A Study of a Simple Class of Modifiers: Product Modifiers
Operations on Permutation Automata
New tools for state complexity
On the state complexity of operations on two-way finite automata
State complexity of four combined operations composed of union, intersection, star and reversal
State complexity of operations on two-way deterministic finite automata over a unary alphabet
Square on Deterministic, Alternating, and Boolean Finite Automata
The complexity of concatenation on deterministic and alternating finite automata
Descriptional complexity of the forever operator
The state complexity of permutations on finite languages over binary alphabets
Star-complement-star on prefix-free languages
State complexity of overlap assembly
Formal languages over GF(2)
Complexity of proper prefix-convex regular languages
Further closure properties of input-driven pushdown automata
State complexity of deletion and bipolar deletion
The exact state complexity for the composition of root and reversal
State complexity bounds for the commutative closure of group languages
scientific article; zbMATH DE number 7770054 (Why is no real title available?)
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
Operational state complexity revisited: the contribution of monsters and modifiers
Operational complexity: NFA-to-DFA trade-off
Operational complexity in subregular classes
Operations on Boolean and Alternating Finite Automata
Concatenation of regular languages and descriptional complexity
Performing regular operations with 1-limited automata
Descriptional complexity of finite automata -- selected highlights
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
Automata for the commutative closure of regular languages
Operational complexity in subregular classes
Square, power, positive closure, and complementation on ordered and star-free languages
Operational complexity: NFA-to-DFA trade-off
State complexity of union and intersection of square and reversal on \(k\) regular languages
Syntactic complexity of regular ideals
State complexity of the minimal star basis
The boundary operation on some subclasses of convex regular languages
State complexity of Boolean operations on graph-walking automata
State complexity of projection on languages recognized by permutation automata and commuting letters
State complexity of inversion operations
Operational state complexity of unary NFAs with finite nondeterminism

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5628039)