scientific article; zbMATH DE number 2081044
From MaRDI portal
Publication:4474150
zbMath1050.68091MaRDI QIDQ4474150
Karel II Culik, Kai Salomaa, Sheng Yu, Cezar Campeanu
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2214/22140060.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Closure properties and descriptional complexity of deterministic regular expressions ⋮ State complexity of permutation on finite languages over a binary alphabet ⋮ Operations on Permutation Automata ⋮ State complexity of combined operations ⋮ On the state complexity of reversals of regular languages ⋮ Time window temporal logic ⋮ Quotient complexity of closed languages ⋮ 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 ⋮ Ordering regular languages and automata: complexity ⋮ Operational complexity in subregular classes ⋮ Concatenation of regular languages and descriptional complexity ⋮ The Average State Complexity of the Star of a Finite Set of Words Is Linear ⋮ Incomplete operational transition complexity of regular languages ⋮ On the average state and transition complexity of finite languages ⋮ On the descriptional complexity of finite automata with modified acceptance conditions ⋮ State complexity of some operations on binary regular languages ⋮ State complexity of finite partial languages ⋮ State-complexity hierarchies of uniform languages of alphabet-size length ⋮ Estimation of state complexity of combined operations ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Syntactic complexity of regular ideals ⋮ Power, positive closure, and quotients on convex languages ⋮ 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 of Catenation Combined with Union and Intersection ⋮ State complexity of unique rational operations ⋮ Concatenation of Regular Languages and Descriptional Complexity ⋮ State Complexity of Prefix Distance of Subregular Languages ⋮ State complexity of basic operations on suffix-free regular languages ⋮ Descriptional complexity of regular languages ⋮ The State Complexity of Permutations on Finite Languages over Binary Alphabets ⋮ Undecidability of state complexity ⋮ State complexity of finite partial languages
This page was built for publication:
