On?-Languages whose syntactic monoid is trivial
From MaRDI portal
Publication:3335014
DOI10.1007/BF01008047zbMath0545.68072MaRDI QIDQ3335014
Helmut Jürgensen, Gabriel Thierrin
Publication date: 1983
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Related Items (8)
Multiple Usage of Random Bits in Finite Automata ⋮ Some remarks on real numbers induced by first-order spectra ⋮ Rebootable and suffix-closed $\omega $-power languages ⋮ Learning regular omega languages ⋮ Inferring regular languages and \(\omega\)-languages ⋮ On syntactic congruences for \(\omega\)-languages ⋮ Which finite monoids are syntactic monoids of rational \(\omega\)-languages ⋮ Finite-state \(\omega\)-languages
Cites Work
This page was built for publication: On?-Languages whose syntactic monoid is trivial