Recursivite et cones rationnels fermes par intersection
- 1 December 1978
- journal article
- Published by Springer Nature in Calcolo
- Vol. 15 (4) , 381-394
- https://doi.org/10.1007/bf02576519
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Petri nets and szilard languagesInformation and Control, 1977
- Renaming and erasing in szilard languagesPublished by Springer Nature ,1977
- Some decision problems related to the reachability problem for Petri netsTheoretical Computer Science, 1976
- Commutative grammarsCalcolo, 1976
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Une hiérarchie des parties rationnelles de N2Theory of Computing Systems, 1973
- Intersection-closed full AFL and the recursively enumerable languagesInformation and Control, 1973
- What makes some language theory problems undecidableJournal of Computer and System Sciences, 1970
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968