On?-Languages whose syntactic monoid is trivial
- 1 October 1983
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 12 (5) , 359-365
- https://doi.org/10.1007/bf01008047
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Algebraische CodierungstheoriePublished by Walter de Gruyter GmbH ,1977
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Infinite sequences and finite machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1963