Nondeterministic State Complexity for Suffix-Free Regular Languages

Details Nondeterministic State Complexity for Suffix-Free Regular Languages Nondeterministic State Complexity for Suffix-Free Regular Languages

2010-08-10

arxiv.org/abs/1008.1661v1

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.

Affiliated with

Also associated with

No associations

Rating

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.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583296