Algebraic Languages: A Bridge between Combinatorics and Computer Science

@inproceedings{Delest1994AlgebraicLA,
  title={Algebraic Languages: A Bridge between Combinatorics and Computer Science},
  author={Maylis Delest},
  booktitle={Formal Power Series and Algebraic Combinatorics},
  year={1994}
}
  • Maylis Delest
  • Published 1994 in Formal Power Series and Algebraic Combinatorics
We describe the classical Schützenberger methodology and two extensions: grammars with operators and q-grammars. In the 1960's, motivated by the interest in writing good compilers, theoretical work was initiated on syntactic formal aspects of languages. In 1964 [30], Randell and Russel did the first complete study of a compiler (this was ALGOL 60), dealing with syntactic structures which continue to be of interest. Recognizing a computer language requires the use of language generators, called… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
14 Citations
31 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

A survey of polyominoes enumeration

  • X. Viennot
  • Actes SFCA'92, Ed. P. Leroux and C. Reutenauer…
  • 1992
Highly Influential
14 Excerpts

Séries formelles en variables non commutatives et applications

  • J. Berstel
  • Actes de la cinquième Ecole de Primptemps d…
  • 1977
Highly Influential
4 Excerpts

Fédou, Grammaires d'objets

  • J.M.I. Dutour
  • 1994
Highly Influential
7 Excerpts

Complexité de l'algorithme d'exclusion mutuelle de Naïmi-Trehel, Actes du 37 ème Congrès de l'ACFAS, UQUAM

  • A. Arnold, M. Delest, S. Dulucq
  • 1989
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…