Sciweavers

Share
JUCS
2010

Orthogonal Concatenation: Language Equations and State Complexity

8 years 3 months ago
Orthogonal Concatenation: Language Equations and State Complexity
: 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. Key Words: language operations, language equations, regular languages, state complexity, decidability
Mark Daley, Michael Domaratzki, Kai Salomaa
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where JUCS
Authors Mark Daley, Michael Domaratzki, Kai Salomaa
Comments (0)
books