Title of article
Orthogonal Concatenation: Language Equations and State Complexity, In Honor of Derick Wood’s 70th Birthday
Author/Authors
Daley, Mark University of Western Ontario - Department of Computer Science and Department of Biology, Canada , Domaratzki, Michael University of Manitoba - Department of Computer Science, Canada , Salomaa, Kai Queen’s University - School of Computing, Canada
From page
653
To page
675
Abstract
A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The notion can be generalized for arbitrary language operations. We consider decidability properties of language orthogonality and the solvability of language equations involving the orthogonal concatenation operation. We establish a tight bound for the state complexity of orthogonal concatenation of regular languages.
Keywords
language operations , language equations , regular languages , state com , plexity , decidability
Journal title
International Journal of Universal Computer Sciences
Journal title
International Journal of Universal Computer Sciences
Record number
2574732
Link To Document