A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages1

 Pál Dömösi  2 - Satoshi Okawa  3

Abstract:

 Slender context-free languages have a complete algebraic characterization by L. Ilie in [?]. In this paper we give another characterization of this class of languages. In particular, using linear Dyck languages instead of unrestricted ones, we obtain a Chomsky-Schützenberger-Stanley type characterization of slender context-free languages.  

Footnotes

  1 This work has been supported by the joint project "Automata & Formal Languages" of the Hungarian Academy of Sciences and Japanese Society for Promotion of Science (No. 15) "Automata & Formal Languages"and by the Hungarian National Foundation for Scientific Research (OTKA T030140). 2 Institute of Mathematics and Informatics, Debrecen University, Debrecen, Egyetem tér 1, H-4032, Hungary, e-mail:domosi@math.klte.hu 3 Faculty of Computer Science and Engineering, the University of Aizu, Aizu-Wakamatsu, 965-8580, Japan, e-mail: okawa@u-aizu.ac.jp 2001-06-15