Grammars Based on the Shuffle Operation
Abstract
We consider generative mechanisms producing languages by starting from a finite set of words and shuffling the current words with words in given sets, depending on certain conditions. Namely, regular and finite sets are given for controlling the shuffling: strings are shuffled only to strings in associated sets. Six classes of such grammars are considered, with the shuffling being done on a leftmost position, on a prefix, arbitrarily, globally, in parallel, or using a maximal selector. Most of the corresponding six families of languages, obtained for finite, respectively for regular selection, are found to be incomparable. The relations of these families with Chomsky language families are briefly investigated.
Key Words
Shuffle operation Chomsky grammars L SystemsCategories
F4.2 [Mathematical Logic and Formal Languages]: Grammars and other Rewriting Systems: Grammar types F4.3 [Mathematical Logic and Formal Languages]: Formal Languages: Operations on languagesPreview
Unable to display preview. Download preview PDF.
References
- [1]B. Berard, Literal shuffle, Theoretical Computer Science, 51 (1987), 281 299.MathSciNetGoogle Scholar
- [2]J. Dassow, Gh. Paun, A. Salomaa, Grammars based on patterns. Intern. J. Found. Computer Sci., 4, 1 (1993), 1 - 14.CrossRefMathSciNetGoogle Scholar
- [3]B. C. Galiukschov, Polukontekstnie gramatiki. Mat. Logica i Mat. Ling., Kalinin Univ, 1981, 38–50 (in Russ.).Google Scholar
- [4]G. H. Higman, Ordering by divisibility in abstract algebra, Proc. London Math. Soc., 3 (1952), 326–336.CrossRefMathSciNetGoogle Scholar
- [5]M. Ito, G. Thierrin, S. S. Yu, Shuffle-closed languages, submitted, 1993.Google Scholar
- [6]M. Jantzen, On shuffle and iterated shuffle, Actes de l’ecole de printemps de theorie. des langages (M. Blab, Ed. ), Murol, 1981, 216–235.Google Scholar
- [7]A. K. Joshi, S. R. Kosaraju, H. M. Yamada, String adjunct grammars: I. Local and distributed adjunction. Inform. Control 21 (1972), 93 116.Google Scholar
- [8]S. Marcus, Contextual grammars. Rev. Roum. Math. Pures Appl, 14, 10 (1969), 1525–1534.MATHGoogle Scholar
- [9]Al. Mateescu, Marcus contextual grammars with shuffled contexts, in Mathematical Aspects of Natural and Formal Languages ( Gh. Paun, ed.), World Sci. Pubi., Singapore, 1994, 275–284.Google Scholar
- [10]L. Nebesky, The ξ-grammar, Prague Studied in Math. Ling., 2 (1966), 147–154.Google Scholar
- [11]Gh. Paun, Grammars for Economic Processes, The Technical Pubi. House, Bucure§ti, 1980 (in Romanian).Google Scholar
- [12]Gh. Paun, Contextual Grammars, The Publ. House of the Romanian Academy of Sciences, Bucureşti, 1982 (in Romanian).Google Scholar
- [13]Gh. Paun, G. Rozenberg, A. Salomaa, Contextual grammars: Erasing, determinism, one-sided contexts, in Developments in Language Theory ( G. Rozenberg, A. Salomaa, eds.), World Sci. Pubi., Singapore, 1994, 370–388.Google Scholar
- [14]Gh. Paun, G. Rozenberg, A. Salomaa, Contextual grammars: Parallelism and blocking of derivation, Fundamenta Informaticae, to appear.Google Scholar
- [15]Gh. Paun, G. Rozenberg, A. Salomaa, Marcus contextual grammars: Modularity and leftmost derivation, in Mathematical Aspects of Natural and Formal Languages (Gh. Paun, ed.),World Sci. Pubi., Singapore, 1994, 375–392.Google Scholar
- [16]G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, London, 1980.Google Scholar
- [17]A. Salomaa, Formal Languages, Academic Press, New York, London, 1973.Google Scholar