Familles de langages fermees par crochet ouvert
- 31 October 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 9 (3) , 385-398
- https://doi.org/10.1016/0304-3975(79)90038-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Familles de langages translatables et fermées par crochetActa Informatica, 1973
- Syntactic operators on full semiAFLsJournal of Computer and System Sciences, 1972
- Finite-turn checking automataJournal of Computer and System Sciences, 1971
- Principal AFLJournal of Computer and System Sciences, 1970
- Checking automata and one-way stack languagesJournal of Computer and System Sciences, 1969
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968
- One-way stack automataJournal of the ACM, 1967
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966
- On Relations Defined by Generalized Finite AutomataIBM Journal of Research and Development, 1965