Paper Info
Title
State complexity of orthogonal catenation
Abstract
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.
Year
Venue
Keywords
2008
Clinical Orthopaedics and Related Research
regular language,formal language,automata theory
DocType
Volume
Citations 
Conference
abs/0904.3366
11
PageRank 
References 
Authors
0.54
6
3
Name
Order
Citations
PageRank
Mark Daley116622.18
Michael Domaratzki226824.98
Kai Salomaa31311138.71