Principality results about some matrix languages families

  • Didier Ferment
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


We investigate the family of matrix languages (studied by A. Salomaa) and the family of matrix languages of index less than K (studied by J. Beauquier and G. Paun), for each K ≥ 1. We solve an open problem : all these families are principal rational cones. Moreover, we establish a relation between their respective generators.


Finite Index Control Word Formal Language Theory Matrix Grammar Matrix Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. BEAUQUIER J. (79): Deux familles de langages incomparables, Information and Control 43, 101–122.Google Scholar
  2. BERSTEL J. (79): Transductions and Context-Free languages, B.G. Teubner, Stuttgart.Google Scholar
  3. GREIBACH S.A. (77): Control Sets on Context-Free Grammar Forms, J. Computer Systems Sci. 15, 35–98.Google Scholar
  4. PAUN G. (77): On the index of grammars and languages, Inf. and Control 35, 259–266.Google Scholar
  5. PAUN G. (79): On the family of finite index matrix languages, J.C.S.S. 18, 267–280.Google Scholar
  6. PAUN G. (80): O ierarchie infinita de limbaje matriceale, St. Cerc. Math., Bucaresti, 32, 267–280.Google Scholar
  7. PAUN G. (81): Gramatici Matriciale, Editura Stiintifica si Enciclopeca, Bucuresti.Google Scholar
  8. PAUN G. (83): Some Context-free like properties of finite index matrix languages, Bull. Math. Soc. Sci. Math. R.S. Roumanie, 27, 83–87.Google Scholar
  9. SALOMAA A. (73): Formal Languages, Academic Press, New York and London.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Didier Ferment
    • 1
  1. 1.L.I.T.P. 248Paris Cedex 05France

Personalised recommendations