Transition complexity of language operations

Authors:
Michael Domaratzki;Kai Salomaa
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, MB, Canada R3T 2T2;School of Computing, Queens University, Kingston, ON, Canada K7L 3N6
Venue:
Theoretical Computer Science
Year:
2007

Citing 15
Cited 4

A lower bound technique for the size of nondeterministic finite automata

Information Processing Letters
Communication complexity and parallel computing

Communication complexity and parallel computing
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Translating regular expressions into small εe-free nondeterministic finite automata

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
A lower bound on the size of ɛ-free NFA corresponding to a regular expression

Information Processing Letters
Descriptional complexity of finite automata: concepts and open problems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Translation of binary regular expressions into nondeterministic ɛ-free automata with O(n log n)transitions

Journal of Computer and System Sciences
State complexity of some operations on binary regular languages

Theoretical Computer Science - Descriptional complexity of formal systems
Complementing unary nondeterministic automata

Theoretical Computer Science - Descriptional complexity of formal systems
Regular expressions: new results and open problems

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
Regular expressions and NFAs without Ε-transitions

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
NFAs with and without ε-transitions

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Lower bounds for the transition complexity of NFAs

Journal of Computer and System Sciences
State Complexity of Nested Word Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Transition Complexity of Incomplete DFAs

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Quantified Score

Hi-index	5.23

Visualization

Abstract

The number of transitions required by a nondeterministic finite automaton (NFA) to accept a regular language is a natural measure of the size of that language. There has been a significant amount of work related to the trade-off between the number of transitions and other descriptional complexity measures for regular languages. In this paper, we consider the effect of language operations on the number of transitions required to accept a regular language. This work extends previous work on descriptional complexity of regular language operations, in particular, under the measures of deterministic state complexity, nondeterministic state complexity and regular expression size.