论文信息 - State Complexity of Orthogonal Catenation

State Complexity of Orthogonal Catenation

A language $L$ is the orthogonal catenation of languages $L_1$ and $L_2$ if every word of $L$ can be written in a unique way as a catenation of a word in $L_1$ and a word in $L_2$. We establish a tight bound for the state complexity of orthogonal catenation of regular languages. The bound is smaller than the bound for arbitrary catenation.

Michael Domaratzki | Mark Daley | Kai Salomaa

[1] Antonio Restivo,et al. On Languages Factorizing the Free Monoid , 1996, Int. J. Algebra Comput..

[2] Yo-Sub Han,et al. State Complexity of Basic Operations on Suffix-Free Regular Languages , 2007, MFCS.

[3] Michael Domaratzki,et al. Transition complexity of language operations , 2007, Theor. Comput. Sci..

[4] Martin Kutrib,et al. Nondeterministic Descriptional Complexity Of Regular Languages , 2003, Int. J. Found. Comput. Sci..

[5] Sheng Yu,et al. The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[6] Sheng Yu,et al. State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[7] Andreas Malcher,et al. Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

[8] Galina Jirásková,et al. State complexity of some operations on binary regular languages , 2005, Theor. Comput. Sci..

[9] B. Ravikumar,et al. A Study on Unique Rational Operations , 2007 .

[10] Juraj Hromkovic,et al. Descriptional Complexity of Finite Automata: Concepts and Open Problems , 2002, J. Autom. Lang. Comb..