scientific article; zbMATH DE number 3677223
From MaRDI portal
Publication:3873564
Cites work
- A characterization of parenthesis languages
- A helpful result for proving inherent ambiguity
- A note on 1-locally linear languages
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- A regularity test for pushdown machines
- A representation theorem for algebraic and context-free power series in noncommuting variables
- Abstract families of deterministic languages
- Chains of full AFL's
- Counter machines and counter languages
- Derivation-bounded languages
- Deterministic context free languages
- Familles de langages translatables et fermées par crochet
- Finite counting automata
- General context-free recognition in less than cubic time
- Générateurs algébriques et systèmes de paires iterantes
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3671713 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3602693 (Why is no real title available?)
- scientific article; zbMATH DE number 3602695 (Why is no real title available?)
- scientific article; zbMATH DE number 3602696 (Why is no real title available?)
- scientific article; zbMATH DE number 3608314 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3310090 (Why is no real title available?)
- scientific article; zbMATH DE number 3313290 (Why is no real title available?)
- scientific article; zbMATH DE number 3361265 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- scientific article; zbMATH DE number 3415401 (Why is no real title available?)
- Inclusion relations among families of context-free languages
- Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
- Langages algébriques, paires iterantes et transductions rationnelles
- Le cylindre des langages linéaires
- Locally linear families of languages
- On Context-Free Languages
- On Relations Defined by Generalized Finite Automata
- Optimization of LR(k) parsers
- Opérations de cylindre et applications séquentielles gauches inverses
- Parenthesis Grammars
- Quasi-realtime languages
- Regularity and Related Problems for Deterministic Pushdown Automata
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Some uniformly erasable families of languages
- Strict deterministic grammars
- Studies in abstract families of languages
- Substitution and bounded languages
- Sur diverses familles de langages fermées par transduction rationnelle
- Sur les rélations rationnelles entre monoides libres
- The Hardest Context-Free Language
- Three theorems on phrase structure grammars of type 1
- Transductions des langages de Chomsky
- Two iteration theorems for some families of languages
- Uniformly erasable AFL
Cited in
(20)- On total regulators generated by derivation relations
- 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
- The interchange or pump (di)lemmas for context-free languages
- On the intersection of stacks and queues
- Langages sur des alphabets infinis
- Formes de langages et de grammaires
- Substitution of semi-AFL's
- On a language without star
- On regular realizability problems for context-free languages
- scientific article; zbMATH DE number 3808975 (Why is no real title available?)
- scientific article; zbMATH DE number 3909763 (Why is no real title available?)
- Sur les centres de DOL-langages
- scientific article; zbMATH DE number 3770980 (Why is no real title available?)
- Properties of infinite words: recent results
- On regularity of context-free languages
- An infinite square-free co-CFL
- Bounded languages described by GF(2)-grammars
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873564)
