On languages in countably generated semilattices
type: Item
instance of: scholarly article
title: On languages in countably generated semilattices
zbMATH Open document ID: 0881.68066
DOI: 10.1007/BF02366544
author: K. V. Shakhbazyan
author: Yu. G. Shukuryan
published in: Cybernetics and Systems Analysis
publication date: 1997-10-06T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1051124
zbMATH Keywords: free commutative monoids
MaRDI profile type: Publication
cites work: Algebra of processes in graphs
full work available at URL: https://doi.org/10.1007/bf02366544
OpenAlex ID: W2041033495
Recommended article: Q3408795
Recommended article: Q3681954
Recommended article: Languages defined with modular counting quantifiers
Recommended article: Q3981836
Recommended article: Q4381392
Recommended article: Q3753509
Recommended article: The complexity of countable categoricity in finite languages
Recommended article: Q3704880
Recommended article: Q3350770
Recommended article: On counting functions of languages
description: scientific article; zbMATH DE number 1051124