Mots infinis engendrés par une grammaire algébrique
Open Access
- 1 January 1977
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 11 (4), 311-327
- https://doi.org/10.1051/ita/1977110403111
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 5 references indexed in Scilit:
- Theory of ω-languagesI: Characterizations of ω-context-free languagesJournal of Computer and System Sciences, 1977
- Non Deterministic Recursive Program SchemesLecture Notes in Computer Science, 1977
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- On context-free languages and push-down automataInformation and Control, 1963