Transition Complexity of Incomplete DFAs
Formal Languages and Automata Theory
2010-08-11 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1008.1652,
title = {Transition Complexity of Incomplete DFAs},
author = {Yuan Gao and Kai Salomaa and Sheng Yu},
journal= {arXiv preprint arXiv:1008.1652},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270