State complexity of orthogonal catenation

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-274585

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.