Quelques problèmes ouverts en théorie des langages algébriques

— We present hère some open questions about the context-free languages.

[1]  Joffroy Beauquier,et al.  Generateurs Algebriques et Systemes de Paires Iterantes , 1979, Theor. Comput. Sci..

[2]  Luc Boasson,et al.  A Note on 1-Locally Linear Languages , 1978, Inf. Control..

[3]  Marcel Paul Schützenberger,et al.  Sur les Relations Rationnelles Entre Monoides Libres , 1976, Theor. Comput. Sci..

[4]  Samuel Eilenberg,et al.  Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975. , 1976, SIGA.

[5]  Andries P.J. van der Walt,et al.  Locally Linear Families of Languages , 1976, Inf. Control..

[6]  Seymour Ginsburg,et al.  Some Uniformly Erasable Families of Languages , 1976, Theor. Comput. Sci..

[7]  Ivan Hal Sudborough,et al.  A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.

[8]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[9]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[10]  Ronald V. Book,et al.  Reversal-Bounded Acceptors and Intersections of Linear Languages , 1974, SIAM J. Comput..

[11]  Sheila A. Greibach,et al.  Jump PDA's and Hierarchies of Deterministic Context-Free Languages , 1974, SIAM J. Comput..

[12]  Luc Boasson,et al.  Two Iteration Theorems for Some Families of Languages , 1973, J. Comput. Syst. Sci..

[13]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[14]  Ivan M. Havel,et al.  Strict Deterministic Grammars , 1973, J. Comput. Syst. Sci..

[15]  Seymour Ginsburg,et al.  Uniformly erasable AFL , 1972, J. Comput. Syst. Sci..

[16]  Jonathan Goldstine,et al.  Substitution and Bounded Languages , 1972, J. Comput. Syst. Sci..

[17]  W. J. Chandler.  Abstract families of deterministic languages , 1969, STOC.

[18]  Seymour Ginsburg,et al.  Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..

[19]  Richard Edwin Stearns,et al.  A Regularity Test for Pushdown Machines , 1967, Inf. Control..

[20]  Donald E. Knuth,et al.  A Characterization of Parenthesis Languages , 1967, Inf. Control..

[21]  Eliahu Shamir,et al.  A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables , 1967, Inf. Control..

[22]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[23]  Mary Katherine Yntema,et al.  Inclusion Relations Among Families Of Context-Free Languages , 1967, Inf. Control..

[24]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[25]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[26]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1965, Inf. Control..

[27]  Peter S. Landweber,et al.  Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..

[28]  Robert W. Floyd,et al.  On ambiguity in phrase structure languages , 1962, CACM.

[29]  Marcel Paul Schützenberger,et al.  Finite Counting Automata , 1962, Inf. Control..

[30]  M. Dal Cin,et al.  The Algebraic Theory of Automata , 1980 .

[31]  Sándor Horváth,et al.  The family of languages satisfying "Bar-Hillel's" lemma , 1978, RAIRO Theor. Informatics Appl..

[32]  Luc Boasson,et al.  On languages satisfying Ogden's lemma , 1978, RAIRO Theor. Informatics Appl..

[33]  Luc Boasson,et al.  Langages Algebriques, Paires Iterantes et Transductions Rationnelles , 1976, Theor. Comput. Sci..

[34]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

[35]  Luc Boasson,et al.  Un critère de rationnalité des langages algébriques , 1972, ICALP.

[36]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[37]  Nice.  Congrés international des mathématiciens, Nice 1970 : Les 265 communications individuelles , 1970 .

[38]  Abraham Ginzburg,et al.  Chapter 5 – Coverings of Automata , 1968 .

[39]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[40]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[41]  Y. BAR-HILLEL,et al.  On formai properties oî simple phreise structure grammars , 1961 .