On?-Languages whose syntactic monoid is trivial

DOI10.1007/BF01008047zbMATH Open0545.68072MaRDI QIDQ3335014FDOQ3335014

Helmut Jürgensen, Gabriel Thierrin

Publication date: 1983

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4009840
• scientific article; zbMATH DE number 512864
• scientific article; zbMATH DE number 604887
• Which finite monoids are syntactic monoids of rational \(\omega\)-languages
• On syntactic congruences for \(\omega\)-languages

zbMATH Keywords

omega languagetrivial syntactic monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Testing and generating infinite sequences by a finite automaton
• Title not available (Why is that?)

Cited In (11)

• Title not available (Why is that?)
• Multiple Usage of Random Bits in Finite Automata
• Some remarks on real numbers induced by first-order spectra
• Title not available (Why is that?)
• Learning regular omega languages
• Title not available (Why is that?)
• Finite-state \(\omega\)-languages
• On syntactic congruences for \(\omega\)-languages
• Which finite monoids are syntactic monoids of rational \(\omega\)-languages
• Inferring regular languages and \(\omega\)-languages
• Rebootable and suffix-closed $\omega $-power languages

This page was built for publication: On?-Languages whose syntactic monoid is trivial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335014)