Langages algebriques, paires iterantes et transductions rationnelles
- 1 January 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 2 (2) , 209-223
- https://doi.org/10.1016/0304-3975(76)90033-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Some uniformly erasable families of languagesTheoretical Computer Science, 1976
- The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is properInformation Processing Letters, 1974
- Two iteration theorems for some families of languagesJournal of Computer and System Sciences, 1973
- Une hiérarchie des parties rationnelles de N2Theory of Computing Systems, 1973
- Sur diverses familles de langages fermées par transduction rationnelleActa Informatica, 1973
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968