This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.P. CRESTIN Langages Quasirationnels Ecole de Printemps de Théorie des Langages Algébriques Bonascre — 1973
S. GINSBURG and S. GREIBACH Abstract Families of Languages, in Studies of Abstract Families of Languages. Memoirs of Am. Math. Soc no87, Providence RI, (1969), p. 1–32.
S. GREIBACH An Infinite Hierarchy of Context-free Languages JACM, 16, (1969), p 91–106
S. GREIBACH Checking Automata and One Way Stack Languages JCSS 3, (1969), p 196–217.
M. NIVAT Transduction des Langages de Chomsky Thèse, Paris, 1967.
F. RODRIGUEZ Cônes d'Accepteurs — Application à l'étude d'une hiérarchie infinie de Langages d'Accepteurs Vérificateurs. A paraitre — 1973
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Rodriguez, F. (1973). Une hierarchie infinie de cones d'Accepteurs verificateurs. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039141
Download citation
DOI: https://doi.org/10.1007/BFb0039141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06527-2
Online ISBN: 978-3-540-37826-6
eBook Packages: Springer Book Archive