Joffroy Beauquier
Affiliations: | Computer Science | Université Paris-Sud 11, Orsay, Bures-sur-Yvette, Île-de-France, France |
Google:
"Joffroy Beauquier"Children
Sign in to add traineeVincent Villain | grad student | Université Paris-Sud 11 | |
Sebastien Tixeuil | grad student | 1995-2000 |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Autebert J, Beauquier J, Boasson L, et al. (1984) Remarques sur les langages de parenthèses Theoretical Computer Science. 31: 337-349 |
Autebert JM, Beauquier J, Boasson L, et al. (1984) Bicentres de langages algébriques Acta Informatica. 21: 209-227 |
Autebert J, Beauquier J, Boasson L, et al. (1982) Indécidabilité de la condition IRS Theoretical Informatics and Applications. 16: 129-138 |
Autebert JM, Beauquier J, Boasson L. (1982) Formes de langages et de grammaires Acta Informatica. 17: 193-213 |
Autebert J, Beauquier J, Boasson L, et al. (1981) Langages algébriques dominés par des langages unaires Information & Computation. 48: 49-53 |
Beauquier J, Berstel J. (1981) More about the “geography” of context-free languages Information & Computation. 49: 91-108 |
Autebert J, Beauquier J, Boasson L. (1980) Langages sur des alphabets infinis Discrete Applied Mathematics. 2: 1-20 |
Autebert J, Beauquier J, Boasson L, et al. (1979) Quelques problèmes ouverts en théorie des langages algébriques Theoretical Informatics and Applications. 13: 363-378 |
Beauquier J. (1979) Generateurs algebriques et systemes de paires iterantes Theoretical Computer Science. 8: 293-323 |
Beauquier J. (1979) Strong Non-Deterministic Context-Free Languages Theoretical Computer Science. 47-57 |