Finite automata and unary languages
Theoretical Computer Science
Intersection and union of regular languages and state complexity
Information Processing Letters
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Handbook of formal languages, vol. 1
NFA to DFA transformation for finite languages over arbitrary alphabets
Journal of Automata, Languages and Combinatorics
Journal of the ACM (JACM)
On Decompositions of Regular Events
Journal of the ACM (JACM)
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Errata to: "finite automata and unary languages"
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Quotient complexity of ideal languages
Theoretical Computer Science
| Hi-index | 0.00 |
We investigate the nondeterministic state complexity of several operations on finite automata accepting star-free languages. It turns out that in most cases exactly the same tight bounds as for general regular languages are reached. This nicely complements the results recently obtained in [8] for the operation problem of star-free languages accepted by deterministic finite automata.