Operational state complexity revisited: the contribution of monsters and modifiers

Cites Work

AUTOMATE, a computing package for automata and finite semigroups
Title not available (Why is that?)
The state complexities of some basic operations on regular languages
On the state complexity of reversals of regular languages
State complexity of some operations on binary regular languages
Estimation of state complexity of combined operations
State complexity of combined operations
On the state complexity of star of union and star of intersection
STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
Title not available (Why is that?)
Title not available (Why is that?)
STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
Title not available (Why is that?)
State complexity of basic language operations combined with reversal
Intersection and union of regular languages and state complexity
Nondeterminism and the size of two way finite automata
State Complexity of Multiple Catenations
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
Title not available (Why is that?)
Title not available (Why is that?)
The exact complexity of star-complement-star
A general approach to state complexity of operations: formalization and limitations
Title not available (Why is that?)
Combination of roots and Boolean operations: an application to state complexity
State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
Title not available (Why is that?)
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach
The State Complexity of Star-Complement-Star
A Study of a Simple Class of Modifiers: Product Modifiers

This page was built for publication: Operational state complexity revisited: the contribution of monsters and modifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175083)