Relational morphisms and operations on recognizable sets
Open Access
- 1 January 1981
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 15 (2) , 149-159
- https://doi.org/10.1051/ita/1981150201491
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Codes and aperiodic languagesPublished by Springer Nature ,2006
- Recognizable sets and power sets of finite semigroupsSemigroup Forum, 1979
- Aperiodic homomorphisms and the concatenation product of recognizable setsJournal of Pure and Applied Algebra, 1979
- Sur les varietes de langages et de monoïdesPublished by Springer Nature ,1979
- Varietes de langages et operationsTheoretical Computer Science, 1978
- Sur le monoide syntactique de L∗ lorsque L est un langage finiTheoretical Computer Science, 1978
- On the Theory of Syntactic Monoids for Rational LanguagesLecture Notes in Computer Science, 1977
- Sur Le Produit De Concatenation Non AmbiguSemigroup Forum, 1976
- On finite monoids having only trivial subgroupsInformation and Control, 1965