The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Theory of Computation: A Primer
Theory of Computation: A Primer
Theory of Codes
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the state complexity of reversals of regular languages
Theoretical Computer Science
State complexity of shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
State complexity of prefix, suffix, bifix and infix operators on regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
State complexity of catenation combined with union and intersection
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Networks of evolutionary processors with subregular filters
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Syntactic complexity of Prefix-, Suffix-, and Bifix-free regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Theoretical Computer Science
On external contextual grammars with subregular selection languages
Theoretical Computer Science
On state complexity of finite word and tree languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Quotient complexity of ideal languages
Theoretical Computer Science
State complexity of combined operations for suffix-free regular languages
Theoretical Computer Science
Quotient Complexity of Closed Languages
Theory of Computing Systems
| Hi-index | 5.23 |
We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.