scientific article; zbMATH DE number 2081044
From MaRDI portal
Publication:4474150
zbMATH Open1050.68091MaRDI QIDQ4474150FDOQ4474150
Authors: Karel II Culik, Kai Salomaa, C. Câmpeanu, Sheng Yu 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2214/22140060.htm
Title of this publication is not available (Why is that?)
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 (44)
- 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
- Closure properties and descriptional complexity of deterministic regular expressions
- Incomplete transition complexity of basic operations on finite languages
- The state complexity of permutations on finite languages over binary alphabets
- State complexity of finite partial languages
- State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages
- On the state complexity of reversals of regular languages
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- State complexity of basic operations on suffix-free regular languages
- State complexity of permutation on finite languages over a binary alphabet
- The state complexities of some basic operations on regular languages
- Title not available (Why is that?)
- State complexity of some operations on binary regular languages
- Syntactic complexity of regular ideals
- On the descriptional complexity of finite automata with modified acceptance conditions
- On the average state and transition complexity of finite languages
- The range of state complexities of languages resulting from the cut operation
- Power, positive closure, and quotients on convex languages
- Estimation of state complexity of combined operations
- State complexity of prefix distance of subregular languages
- State complexity of combined operations
- State complexity of four combined operations composed of union, intersection, star and reversal
- Tight bounds for cut-operations on deterministic finite automata
- State complexity of unique rational operations
- State complexity of finite partial languages
- The Average State Complexity of the Star of a Finite Set of Words Is Linear
- State-complexity hierarchies of uniform languages of alphabet-size length
- Operational complexity in subregular classes
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
- Concatenation of Regular Languages and Descriptional Complexity
- Quotient complexity of closed languages
- Concatenation of regular languages and descriptional complexity
- Title not available (Why is that?)
- Time window temporal logic
- Ordering regular languages and automata: complexity
- Descriptional complexity of regular languages
- Incomplete operational transition complexity of regular languages
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Undecidability of state complexity
- State complexity of catenation combined with union and intersection
- Operations on Permutation Automata
- Implementation and Application of Automata
- Title not available (Why is that?)
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)
