Free Access
Volume 4, Number R3, 1970
Page(s) 3 - 29
Published online 01 February 2017
  1. C. CHEVALLEY, Fundamental concepts of algebra, Academic Press, New York (1956). [MR: 82459] [Zbl: 0074.01502] [Google Scholar]
  2. N. CHOMSKY, On certain formal properties of grammars, Information and Control 2 (1959), p. 137-167. [MR: 105365] [Zbl: 0088.10801] [Google Scholar]
  3. N. CHOMSKY, Aspects of the theory of syntax, The M.I.T. Press, Cambridge (1965). [Google Scholar]
  4. N. CHOMSKY et M. P. SCHUTZENBERGER, The algebraic theory of contex-free languages. Computer programming and formal Systems (Braffort, Hirschberg, editors), North Holland, Amsterdam (1963), p. 118-161. [MR: 152391] [Zbl: 0148.00804] [Google Scholar]
  5. K. CULIK, On some transformations in context-free grammars and languages, Czecholovak Mathematical Journal 17 (1967), p. 278-311. [EuDML: 12361] [MR: 214410] [Zbl: 0204.02103] [Google Scholar]
  6. S. GINSBURG, The mathematical theory of context-free languages, McGraw-Hill, New York (1966). [MR: 211815] [Zbl: 0184.28401] [Google Scholar]
  7. S. KUNO et O. OETTINGER, Multiple-path syntactic analyzer, Information Processing 62 (Propplewell, editor), North Holland, Amsterdam (1963). p. 306-312. [Zbl: 0134.33405] [Google Scholar]
  8. R. MCNAUGHTON, Parenthesis grammars, Journal of the ACM 14 (1967), p. 490-500. [MR: 234781] [Zbl: 0168.01206] [Google Scholar]
  9. J. MYHILL, Finite automata and the représentation of events, Wright Air Development Command Technical Report, 57-624 (1957), p. 112-137. [Google Scholar]
  10. M. NIVAT, Transductions des langages de Chomsky. Thèse, Annales de l'Institut Fourier, Université de Grenoble (1968). [EuDML: 73950] [MR: 238633] [Zbl: 0313.68065] [Google Scholar]
  11. C. PAIR, Étude de la notion de pile, application à l'analyse syntaxique. Thèse, Faculté des Sciences de l'Université de Nancy (1965). [Google Scholar]
  12. C. PAIR et A. QUERE, Définition et étude des bilangages réguliers, Information and Control 13 (1968), p. 565-593. [MR: 250803] [Zbl: 0181.01603] [Google Scholar]
  13. R. PETER, Die Pair-Quere-schen freien Binoïden als Speziallfälle der angeordneten freien holomorphen Mengen, Eötvös Lorand Universität Budapest (1968). [Zbl: 0184.01804] [Google Scholar]
  14. M. O. RABIN et D. SCOTT, Finite automata and their décision problems, IBM Journal of Research and Development 3 (1959), p. 246-264. [MR: 103795] [Zbl: 0158.25404] [Google Scholar]
  15. M. P. SCHUTZENBERGER, On context-free languages and pushdown automata, Information and Control 6 (1963), p. 246-264. [MR: 163809] [Zbl: 0123.12502] [Google Scholar]
  16. S. H. UNGER, On syntax directed translators, R. C.A. Laboratories (1963). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

Recommended for you