State Complexity of Combined Operations for Prefix-Free Regular Languages - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu. State Complexity of Combined Operations for Prefix-Free Regular Languages. In Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, editors, Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005). pages 137-151, The Publishing House of the Romanian Academy, 2014.

The following publications are possibly variants of this publication:

State Complexity of Combined Operations for Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Sheng Yu. LATA 2009: 398-409 [doi]

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. FUIN, 90(1-2):93-106, 2009. [doi]

State complexity of combined operations for suffix-free regular languagesHae-Sung Eom, Yo-Sub Han. TCS, 510:87-93, 2013. [doi]

State Complexity of Boundary of Prefix-Free Regular LanguagesHae-Sung Eom, Yo-Sub Han. ijfcs, 26(6):697-708, 2015. [doi]

State Complexity of Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. dcfs 2006: 165-176

Operational State Complexity of Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. birthday 2009: 99-115

State Complexity of k-Union and k-Intersection for Prefix-Free Regular LanguagesHae-Sung Eom, Yo-Sub Han, Kai Salomaa. dcfs 2013: 78-89 [doi]

State complexity of basic operations on suffix-free regular languagesYo-Sub Han, Kai Salomaa. TCS, 410(27-29):2537-2548, 2009. [doi]

State Complexity of Basic Operations on Suffix-Free Regular LanguagesYo-Sub Han, Kai Salomaa. mfcs 2007: 501-512 [doi]

runs on WebDSL