Contexts on trajectories

References

• Delany , P. 1991 . Hypermedia and Literary Studies , Edited by: Landow , G.P. Cambridge, , England : The MIT Press . London
   Google Scholar
• Ehrenfeucht , A. , Rozenberg , G. , P[acaron]un , G. and Rozenberg , G. 1997 . “ Contextual Grammars and Formal Languages ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 2 , 237 – 294 . Berlin, New York : Springer .
   Google Scholar
• Ginsburg , S. 1966 . The Mathematical Theory of Context-Free Languages , New York : McGraw-Hill .
   Google Scholar
• Haines , L.H. 1969 . On free monoids partially ordered by embedding . Journal of Combinatorial Theory , 6 : 94 – 98 .
   Google Scholar
• Higman , G.H. 1952 . Ordering by divisibility in abstract algebras . Proc. London Math.Soc , 3 : 326 – 336 .
   Google Scholar
• Ibarra , O. 1970 . Simple matrix languages . Information and Control , 17 : 394
   Google Scholar
• Joshi , A.K. 1985 . “ How much context-sensitivity is required to provide reasonable structural descriptions? Tree adjoining grammars ” . In Natural Language Processing:Psycholinguistic, Computational, and Theoretic Perspectives , 206 – 250 . Cambridge, New York : Cambridge University Press .
   Google Scholar
• Joshi , A.K. and Schabes , Y. 1997 . “ Tree-Adjoining Grammars ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 3 , 69 – 124 . Berlin, New York : Springer .
   Google Scholar
• Kudlek , M. , Marcus , S. and Mateescu , A. 1997 . “ Contextual Grammars with Distributed Catenation and Shuffle ” . In Fundamentals of Computation Theory, FCT97 , Edited by: Chlebus , B.S. and Czeja , L. 269 – 280 . Springer Verlag . Lecture Notes in Computer Science, LNCS
   Google Scholar
• Kudlek , M. , Vide , C. and Mateescu , A. 1998 . “ An infinite hierarchy of mildly context-sensitive families of languages ” . In Workshop on Mathematical Linguistics , The Pennsylvania State University . WML'98to appear
   Google Scholar
• Kuich , W. and Salomaa , A. 1986 . Semirings, Automata, languages , Berlin, , Tokyo : Springer-Verlag . Heidelberg
   Google Scholar
• Marcus , S. 1967 . Algebraic Linguistics; Analytical Models , London, New York : Academic Press .
   Google Scholar
• Marcus , S. 1969 . Contextual Grammars . Rev. Mourn, Math. Pures et Appl , 14 ( 10 ) : 1525 – 1534 .
   Google Scholar
• Marcus , S. 1997 . “ Contextual Grammars and Natural Languages ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 2 , 215 – 236 . Berlin, New York : Springer .
   Google Scholar
• Martin Vide , C. , Mateescu , A. , Miquel Vergé , J. and Salomaa , A. 1996 . Quasi shuffle Marcus Grammars . Proc, of XII Congress on Natural and Formal Languages . 1996 , Spain. pp. 495 – 499 .
   Google Scholar
• Mateescu , A. 1994 . “ Marcus Grammars with Shuffled Contexts ” . In Mathematical Aspects of Natural and Formal Languages , 275 – 284 . World Scientific .
   Google Scholar
• Mateescu , A. , Rosenberg , G. and Salomaa , A. 1998 . Shuffle on trajectories:Syntactic Constraints . Theoretical Computer Science, TCS, Fundamental Study , 197 ( 1-2 ) : 1 – 56 .
   Web of Science ®Google Scholar
• P[acaron]un , G. 1997 . Marcus Contextual Grammars , Dordrecht : Kluwer Academic Publishers . Boston, London
   Google Scholar
• Raz , D. 1997 . Length considerations in context-free languages . Theoretical Computer Science, TCS , 183 : 21 – 32 .
   Google Scholar
• Rozenberg , G. 1997 . Handbook of Formal Languages , Edited by: Salomaa , A. Berlin, New York : Springer .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , London, New York : Academic Press .
   Google Scholar