Publication:4474150
From MaRDI portal
zbMath1050.68091MaRDI QIDQ4474150
Kai Salomaa, Sheng Yu, Karel II Culik, Cezar Campeanu
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2214/22140060.htm
68Q45: Formal languages and automata
Related Items
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal, 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, On the state complexity of reversals of regular languages, Concatenation of regular languages and descriptional complexity, State complexity of unique rational operations, State complexity of basic operations on suffix-free regular languages, On the descriptional complexity of finite automata with modified acceptance conditions, State complexity of some operations on binary regular languages, State-complexity hierarchies of uniform languages of alphabet-size length, Estimation of state complexity of combined operations, State complexity of combined operations, On the average state and transition complexity of finite languages, Undecidability of state complexity, State Complexity of Catenation Combined with Union and Intersection, Concatenation of Regular Languages and Descriptional Complexity, The Average State Complexity of the Star of a Finite Set of Words Is Linear, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity, State Complexity of Combined Operations for Prefix-Free Regular Languages
