State complexity of orthogonal catenation

Details State complexity of orthogonal catenation State complexity of orthogonal catenation

2009-04-22

arxiv.org/abs/0904.3366v1

Computer Science

Formal Languages and Automata Theory

DCFS 2008

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

State complexity of orthogonal catenation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with State complexity of orthogonal catenation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State complexity of orthogonal catenation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-274585