Transition Complexity of Incomplete DFAs

Details Transition Complexity of Incomplete DFAs Transition Complexity of Incomplete DFAs

2010-08-10

arxiv.org/abs/1008.1652v1

EPTCS 31, 2010, pp. 99-109

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.12

In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained. It is shown that the transition complexity results for union and complementation are very different from the state complexity results for the same operations. However, for intersection, the transition complexity result is similar to that of state complexity.

Affiliated with

Also associated with

No associations

Rating

Transition Complexity of Incomplete DFAs 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 Transition Complexity of Incomplete DFAs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transition Complexity of Incomplete DFAs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583263