Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 71, 1999 - Issue 3
Submit an article Journal homepage
22
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Middle quotients of linear languages

Alexander Meduna Computing Center, Technical University of Brno Udolni 19, Brno, 60200, The Czech Republic
Pages 319-335 | Received 29 Apr 1998, Published online: 20 Mar 2007

References

  • Dassow , J. and Paun , G. 1989 . Regulated Rewriting in Formal Language Theory , New York : Springer .
  • Kleijn , H. C M. and Rozenberg , G. 1983 . On the Generative Power of Re gular Pattern Grammars . Acta Informatica , 20 : 391 – 411 .
  • Latteux , M. and Turakainen , P. 1990 . On Characterizations of Recursively Enumerable Languages . Acta Informatica , 28 : 179 – 186 .
  • Meduna , A. 1987 . Characterization of the Chomsky Hierarchy through Sequential- Parallel Grammars . Rostock. Math. Kolloq , 32 : 4 – 14 .
  • Meduna , A. and Horvath , G. 1988 . On State Grammars . Acta Cybernetica , 8 : 237 – 245 .
  • Meduna , A. 1990 . Context Free Derivations on Word Monoids . Acta Informatica , 27 : 781 – 786 .
  • Meduna , A. 1990 . Generalized Forbidding Grammars . International Journal of Computer Mathematics , 36 : 31 – 38 .
  • Meduna , A. 1991 . Global Context Conditional Grammars . J. Inform. Process. Cvbern. , 27 : 159 – 165 .
  • Meduna , A. 1992 . Symbiotic EOL Systems . Acta Cybernetika , 12 : 164 – 172 .
  • Meduna , A. 1992 . A Formalization of Sequential . Parallel, and Continuous Rewriting, International Journal of Computer Mathematics , 42 : 24 – 32 .
  • Meduna , A. and Gopalaratnam , M. 1994 . On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions . Acta Cybernetica , 11 : 309 – 323 .
  • Meduna , A. 1995 . A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars . Eatcs Bulletin , 56 : 104 – 106 .
  • Meduna , A. 1997 . Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages . International Journal of Computer Mathematics , 63 : 67 – 83 .
  • Meduna , A. 1997 . Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages . International Journal of Computer Mathematics , 65 : 179 – 189 .
  • Rozenberg , G. and Salomaa , A. 1997 . Handbook of Formal Languages Vol. 1 ,

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.