State complexity of orthogonal catenation
Abstract
A language L is the orthogonal catenation of languages L1 and L2 if every word of L can be written in a unique way as a catenation of a word in L1 and a word in L2. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.