On languages in countably generated semilattices

DOI10.1007/BF02366544zbMATH Open0881.68066OpenAlexW2041033495MaRDI QIDQ1364097FDOQ1364097

K. V. Shakhbazyan, Yu. G. Shukuryan

Publication date: 6 October 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366544

zbMATH Keywords

free commutative monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Algebra of processes in graphs

Cited In (3)

• On languages defined by generalized principal right congruences
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• On the semigroup languages and the regular languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Languages defined with modular counting quantifiers 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The complexity of countable categoricity in finite languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On counting functions of languages 👍 👎

This page was built for publication: On languages in countably generated semilattices

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