A characterization of s-languages

Information Processing Letters

Volumn 89, Issue 2, 2004, Pages 65-70

  Fraczak, Wojciech ^a   Podolak, Anna ^a  

^a IDT Canada   (Canada)

Author keywords

Formal languages; Minimal deterministic automaton; Prefix code; S language

Indexed keywords

CODES (SYMBOLS); CONTEXT FREE GRAMMARS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

DETERMINISTIC METHODS; DIRECTED GRAPHS (DIGRAPHS);

CONTEXT FREE LANGUAGES;

EID: 0347412020     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.10.006     Document Type: Article

References (6)

1. Autebert J.-M., Berstel J., Boasson L. Context-free languages and pushdown automata. Salomaa A., Rozenberg G. Word Language Grammar. Handbook of Formal Languages. 1:1997;111-174 Springer-Verlag, Berlin.
2. Czyzowicz J., Fraczak W., Pelc A., Rytter W. Prime decompositions of regular prefix codes. Implementation and Application of Automata, CIAA 2002. Lecture Notes in Comput. Sci. 2608:July 2003;85-94 Springer, Tours, France.
3. Eilenberg S. Automata, Languages, and Machines, Vol. A. 1974;Academic Press, New York.
4. Korenjak A.J., Hopcroft J.E. Simple deterministic languages. Proc. IEEE 7th Annual Symp. on Switching and Automata Theory, IEEE Symposium on Foundations of Computer Science. 1966;36-46.
5. Kurki-Suonio R. Notes on top-down languages. BIT. 9:1969;225-238.
6. Pin J.-E. Varietes de langages formels. 1984;Masson, Paris.