Han, Yo-Sub Salomaa, Kai Yu, Sheng 2024-01-19T13:08:26Z 2024-01-19T13:08:26Z 2022-03-07 2009 0302-9743 https://pubs.kist.re.kr/handle/201004/116065 We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finite-state 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. English SPRINGER-VERLAG BERLIN State Complexity of Combined Operations for Prefix-Free Regular Languages Conference 10.1007/978-3-642-00982-2_34 1 3rd International Conference on Language and Automata Theory and Applications, v.5457, pp.398 - + 3rd International Conference on Language and Automata Theory and Applications 5457 398 + GE Tarragona, SPAIN 2009-04-02 LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS 000265784300034 Proceedings Paper