Two iteration theorems for some families of languages
- 31 December 1973
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 7 (6) , 583-596
- https://doi.org/10.1016/s0022-0000(73)80036-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Sur diverses familles de langages fermées par transduction rationnelleActa Informatica, 1973
- Principal AFLJournal of Computer and System Sciences, 1970
- Rational sets in commutative monoidsJournal of Algebra, 1969
- Studies in abstract families of languagesMemoirs of the American Mathematical Society, 1969
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968
- On Relations Defined by Generalized Finite AutomataIBM Journal of Research and Development, 1965