scientific article; zbMATH DE number 2081044
From MaRDI portal
Publication:4474150
Recommendations
- The state complexities of some basic operations on regular languages
- State Complexity of Basic Operations on Suffix-Free Regular Languages
- State complexity of some operations on binary regular languages
- Incomplete transition complexity of basic operations on finite languages
- The state complexity of two combined operations: star of catenation and star of reversal
Cited in
(43)- On the average state and transition complexity of finite languages
- The state complexity of permutations on finite languages over binary alphabets
- State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages
- State complexity of finite partial languages
- scientific article; zbMATH DE number 2201371 (Why is no real title available?)
- 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
- State complexity of some operations on binary regular languages
- State complexity of combined operations
- Tight bounds for cut-operations on deterministic finite automata
- Ordering regular languages and automata: complexity
- The Average State Complexity of the Star of a Finite Set of Words Is Linear
- Estimation of state complexity of combined operations
- Concatenation of Regular Languages and Descriptional Complexity
- Time window temporal logic
- Implementation and Application of Automata
- scientific article; zbMATH DE number 2201359 (Why is no real title available?)
- Undecidability of state complexity
- The range of state complexities of languages resulting from the cut operation
- On the state complexity of reversals of regular languages
- Power, positive closure, and quotients on convex languages
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- State complexity of four combined operations composed of union, intersection, star and reversal
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- State-complexity hierarchies of uniform languages of alphabet-size length
- Incomplete transition complexity of basic operations on finite languages
- State complexity of finite partial languages
- State complexity of basic operations on suffix-free regular languages
- On the descriptional complexity of finite automata with modified acceptance conditions
- State complexity of catenation combined with union and intersection
- State complexity of unique rational operations
- State complexity of prefix distance of subregular languages
- Syntactic complexity of regular ideals
- Operational complexity in subregular classes
- Descriptional complexity of regular languages
- State complexity of permutation on finite languages over a binary alphabet
- scientific article; zbMATH DE number 1962776 (Why is no real title available?)
- Incomplete operational transition complexity of regular languages
- Closure properties and descriptional complexity of deterministic regular expressions
- Operations on Permutation Automata
- Concatenation of regular languages and descriptional complexity
- The state complexities of some basic operations on regular languages
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
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 Q4474150)
