TOWARDS AN ALGEBRAIC THEORY OF CONTEXT-FREE LANGUAGES

Authors:
J. Berstel;L. Boasson
Affiliations:
(Partially supported by the PRC “Mathématiques et Informatique” and by ESPRIT BRA working group 6317 - ASMICS 2) LITP, Institut Blaise Pascal, Université Pierre et Marie Curi ...;LITP, Université Denis Diderot, 2, place Jussieu, F-75251 Paris Cedex 05, France
Venue:
Fundamenta Informaticae
Year:
1996

Citing 7
Cited 0

A representation theorem of infinite dimensional algebras and applications to language theory

Journal of Computer and System Sciences
Formal languages

Formal languages
An elementary proof of double Greibach normal form

Information Processing Letters
Matrix Equations and Normal Forms for Context-Free Grammars

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction to Formal Language Theory

Introduction to Formal Language Theory
A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version)

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of the paper is to present the implications of a new definition of context-free languages. The main interests of this approach are first to allow full formal proofs and second to enlight the crucial role of rational closures. The proposed formalism is based on a theorem of Wechler. It is very near to the “radical algebras” of Conway.