TY - GEN
T1 - State complexity of combined operations for prefix-free regular languages
AU - Han, Yo Sub
AU - Salomaa, Kai
AU - Yu, Sheng
PY - 2009
Y1 - 2009
N2 - We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finitestate automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation.
AB - We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finitestate automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation.
UR - http://www.scopus.com/inward/record.url?scp=67649933933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67649933933&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-00982-2_34
DO - 10.1007/978-3-642-00982-2_34
M3 - Conference contribution
AN - SCOPUS:67649933933
SN - 9783642009815
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 398
EP - 409
BT - Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
T2 - 3rd International Conference on Language and Automata Theory and Applications, LATA 2009
Y2 - 2 April 2009 through 8 April 2009
ER -