Incomplete Transition Complexity of Basic Operations on Finite Languages
The state complexity of basic operations on finite languages (considering complete DFAs) has been extensively studied in the literature. In this paper we study the incomplete (deterministic) state and transition complexity on finite languages of boolean operations, concatenation, star, and reversal. For all operations we give tight upper bounds for both descriptional measures. We correct the published state complexity of concatenation for complete DFAs and provide a tight upper bound for the case when the right automaton is larger than the left one. For all binary operations the tightness is proved using family languages with a variable alphabet size. In general the operational complexities depend not only on the complexities of the operands but also on other refined measures.
Unable to display preview. Download preview PDF.
- 1.Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford University (2003)Google Scholar
- 3.Cassandras, C.G., Lafortune, S.: Introduction to discrete event systems. Springer (2006)Google Scholar
- 6.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
- 8.Maurel, D., Guenthner, F.: Automata and Dictionaries. College Publications (2005)Google Scholar
- 11.Shallit, J.: A Second Course in Formal Languages and Automata Theory. CUP (2008)Google Scholar
- 12.Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer (1997)Google Scholar