Paper Info
Title
Incomplete transition complexity of basic operations on finite languages
Abstract
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.
Year
DOI
Venue
2013
10.1007/978-3-642-39274-0_31
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Keywords
DocType
Volume
basic operation,state complexity,operational complexity,incomplete transition complexity,boolean operation,finite language,binary operation,transition complexity,published state complexity,complete dfas,upper bound
Conference
abs/1302.0750
Citations 
PageRank 
References 
2
0.37
6
Authors
3
Name
Order
Citations
PageRank
Eva Maia1112.05
Nelma Moreira218033.98
Rogério Reis314025.74