This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Bibliographie
AHO A.V. and J.D. ULLMAN: The Theory of Parsing, Translation and Compiling. Prentice-Hall (1972).
AUTEBERT J.M.: Non-Principalité du Cylindre des Langages à Compteur. Math.System Theory 11 (1977), p. 157–167.
BERSTEL J.: Congruences Plus que Parfaites et Langages Algébriques. Séminaire d'Informatique Théorique. L.I.T.P. (1975–77) p. 123–147.
BOASSON L.: Un Langage Particulier. R.A.I.R.O. — Informatique Théorique 13 (1979), p. 203–215.
BOASSON L. et M. NIVAT: Parenthesis Generators. 17th Annual I.E.E. Symposimm (F.O.C.S.) (1976), p. 253–257.
BURSTALL R. and J. DARLINGTON: A Transformation System for Developping Recursive Programs. Jour. of A.C.M. 24 (1977), p. 44–67.
BUTZBACH P.: Une famille de Congruences de Thue pour lesquelles l'Equivalence est Décidable. 1st I.C.A.L.P. North-Holland (1973) p. 3–12.
CHANDLER W.J.: Abstract Families of Deterministic Languages. 1st A.C.M. S.I.G.A.C.T. (1969), p. 21–30.
COCHET Y. et M. NIVAT: Une Généralisation des Ensembles de Dyck. Israel Jour. of Math. 9 (1971), p. 389–395.
FROUGNY C.: Langages très simples Générateurs. R.A.I.R.O. Informatique Théorique 13 (1979), p. 69–86.
GINSBURG S. and S.A. GREIBACH: Abstract Families of Languages. Memoirs of the Amer. Math. Soc. 87 (1969), p. 1–32.
GINSBURG S. and M. HARRISON: Bracketed Context-Free Languages. Jour. of Computer and System Science 1 (1967), p. 1–23.
GREIBACH S.A.: Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science 36 (1975), Springer.
GREIBACH S.A.: One-Counter Languages and the I.R.S. Condition. Jour. of Computer and System Science 10 (1975), p. 237–247.
GREIBACH S.A. and S. GINSBURG: Multitape A.F.A. Jour. of A.C.M. 19 (1972), p. 193–221.
HOPCROFT J. and J.D. ULLMAN: Formal Languages and their Relationship to Automata. Addison-Wesley (1969).
HOTZ G.: Uber die Darstellbarkeit des Syntaktischen Monoides Kontext-Freier Spracher. Rapport de l'Université de Saarbruck.
KOTT L.: About a Transformation System: a Theoretical Study. 3ème Colloque International sur la Programmation. Paris (1978), B. Robinet Ed.
Mc NAUGHTON R.: Parenthesis Grammars. Jour. of A.C.M. 14 (1967), p. 490–500.
SALOMAA A.: Formal Languages. Academic Press (1973).
STANAT D.F.: Formal Languages and Power Series. 3rd A.C.M. S.I.G.A.C.T. (1971) p. 1–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boasson, L. (1980). Derivations et reductions dans les grammaires algebrioues. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_64
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive