scientific article
From MaRDI portal
Publication:3873564
zbMath0434.68056MaRDI QIDQ3873564
Jean-Michel Autebert, Maurice Nivat, Luc Boasson, Joffroy Beauquier
Publication date: 1979
Full work available at URL: https://eudml.org/doc/92110
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyconescylindersconjecturesalgebraic languagescontext free languageshistoricalAFLiteration theoremstrios
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (20)
On total regulators generated by derivation relations ⋮ Bounded languages described by GF(2)-grammars ⋮ Analytic models and ambiguity of context-free languages ⋮ Applications of an infinite square-free co-CFL ⋮ On the intersection of the class of linear context-free languages and the class of single-reset languages ⋮ On regular realizability problems for context-free languages ⋮ The interchange or pump (di)lemmas for context-free languages ⋮ On the intersection of stacks and queues ⋮ Properties of infinite words : Recent results ⋮ Langages sur des alphabets infinis ⋮ Sur les centres de DOL-langages ⋮ Formes de langages et de grammaires ⋮ Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.) ⋮ Substitution of semi-AFL's ⋮ On a language without star ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On regularity of context-free languages ⋮ An infinite square-free co-CFL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two iteration theorems for some families of languages
- Familles de langages translatables et fermées par crochet
- General context-free recognition in less than cubic time
- Transductions des langages de Chomsky
- Uniformly erasable AFL
- Some uniformly erasable families of languages
- Sur les rélations rationnelles entre monoides libres
- Langages algébriques, paires iterantes et transductions rationnelles
- Opérations de cylindre et applications séquentielles gauches inverses
- Générateurs algébriques et systèmes de paires iterantes
- Derivation-bounded languages
- Substitution and bounded languages
- Sur diverses familles de langages fermées par transduction rationnelle
- Strict deterministic grammars
- Optimization of LR(k) parsers
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Regularity and Related Problems for Deterministic Pushdown Automata
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- Locally linear families of languages
- Le cylindre des langages linéaires
- A note on 1-locally linear languages
- The Hardest Context-Free Language
- Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
- Abstract families of deterministic languages
- On Relations Defined by Generalized Finite Automata
- Deterministic context free languages
- On Context-Free Languages
- A regularity test for pushdown machines
- A representation theorem for algebraic and context-free power series in noncommuting variables
- Counter machines and counter languages
- Parenthesis Grammars
- A helpful result for proving inherent ambiguity
- Quasi-realtime languages
- Studies in abstract families of languages
- A characterization of parenthesis languages
- Chains of full AFL's
- Inclusion relations among families of context-free languages
- Three theorems on phrase structure grammars of type 1
- Finite counting automata
This page was built for publication:
