Anna Podolak

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We show that a language L is an s-language if and only if the set of the quotients of L (i.e., the set of the states of its minimal deterministic automaton seen as languages) is a subset of a free monoid generated by a finite set of prefix codes. We demonstrate through examples how to use this result for deciding whether a given language is an s-language.
  • 1