State complexity of power
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2068873 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- On the state complexity of star of union and star of intersection
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State complexity of basic language operations combined with reversal
- State complexity of combined operations
- The state complexities of some basic operations on regular languages
- The state complexity of \(L^{2}\) and \(L^k\)
- The state complexity of two combined operations: star of catenation and star of reversal
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(32)- State complexity of star of union and square of union on \textit{k} regular languages
- Undecidability of state complexity
- A Study of a Simple Class of Modifiers: Product Modifiers
- State complexity of Kleene-star operations on trees
- State complexity of union and intersection of star on \(k\) regular languages
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- State complexity of two combined operations: catenation-union and catenation-intersection
- Nondeterministic operational complexity in subregular languages
- 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
- A combinatorial approach for the state complexity of the shuffle product
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- State complexity of operations on two-way finite automata over a unary alphabet
- Operations on subregular languages and nondeterministic state complexity
- On the state complexity of scattered substrings and superstrings
- State complexity of combined operations with two basic operations
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of catenation combined with union and intersection
- On the linear complexity profile of the power generator
- scientific article; zbMATH DE number 7453083 (Why is no real title available?)
- Square on Deterministic, Alternating, and Boolean Finite Automata
- Complexity in union-free regular languages
- Descriptional complexity of regular languages
- State complexity of deletion and bipolar deletion
- scientific article; zbMATH DE number 1747444 (Why is no real title available?)
- On the state complexity of operations on two-way finite automata
- State complexity of operations on input-driven pushdown automata
- State complexity of two combined operations: catenation-star and catenation-reversal
- The state complexity of random DFAs
- Operational state complexity of subtree-free regular tree languages
- State complexity of unambiguous operations on finite automata
- On the State Complexity of Operations on Two-Way Finite Automata
This page was built for publication: State complexity of power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019718)
