Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-08-10
EPTCS 31, 2010, pp. 189-196
Computer Science
Formal Languages and Automata Theory
In Proceedings DCFS 2010, arXiv:1008.1270
Scientific paper
10.4204/EPTCS.31.21
We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We consider basic operations (catenation, union, intersection, Kleene star, reversal and complementation) and establish matching upper and lower bounds for each operation. In the case of complementation the upper and lower bounds differ by an additive constant of two.
Han Yo-Sub
Salomaa Kai
No associations
LandOfFree
Nondeterministic State Complexity for Suffix-Free Regular Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nondeterministic State Complexity for Suffix-Free Regular Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nondeterministic State Complexity for Suffix-Free Regular Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-583296