A characterization of s-languages

Authors:
Wojciech Fraczak;Anna Podolak
Affiliations:
IDT Canada, Inc., 1575 Carling Av., Ottawa, Ontario, K1Z 7M3 Canada;IDT Canada, Inc., 1575 Carling Av., Ottawa, Ontario, K1Z 7M3 Canada
Venue:
Information Processing Letters
Year:
2004

Citing 2
Cited 3

Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
Automata, Languages, and Machines

Automata, Languages, and Machines

Prime normal form and equivalence of simple grammars

Theoretical Computer Science - Implementation and application of automata
Concatenation state machines and simple functions

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Prime normal form and equivalence of simple grammars

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.