Abstract
In this paper we introduce a new class of formal languages called shuffle-based multilanguages which generalize both context-free and Marcus contextual languages. We study some properties of shuffle-based multilanguages related to the requirements of mildly context-sensitive formalisms.
Similar content being viewed by others
References
Goguen, J. and J. Meseguer. Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105:217–273, 1992.
Gramatovici, R. Contextual multilanguages and operatorial automata. Technical Report FBI-HH-B-213, Hamburg University, 61–71, 1998a.
Gramatovici, R. Constraint context-free multilanguages. Annals of the Bucharest University, Mathematics-Informatics Series, 47:73–82, 1998b.
Gramatovici, R. Contextual multilanguages: a learning method. In L. Polkowski and A. Skowron, editors, Rough Sets and Current Trends in Computing, pages 107–111, Springer-Verlag, LNCS Series, Berlin, 1998c.
Joshi, A. K. How much context-sensitivity is required to provide reasonable structural descriptions? Tree adjoining grammars. In D.R. Dowty et al. editors, Natural Language Processing: Psycholinguistic, Computational and Theoretic Perspectives, pages 206–250, Cambridge University Press, New York, 1985.
Kudlek, M., S. Marcus and A. Mateescu. Contextual grammars with distributed catenation and shuffle. Technical Report FBI-HH-B-200/97, University of Hamburg, 1997.
Marcus, S. Contextual grammars. Rev. Roum. Math. Pures Appl., 14, 10:69–74, 1969.
Păun, Gh. Marcus Contextual Grammars. Kluwer, Dordrecht, Boston, London, 1997.
Păun, Gh. and X. M. Nguyen. On the inner contextual grammars. Rev. Roum. Math. Pures Appl., 25:641–651, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gramatovici, R. Shuffle-Based Multilanguages. Grammars 2, 201–210 (1999). https://doi.org/10.1023/A:1009974704345
Issue Date:
DOI: https://doi.org/10.1023/A:1009974704345