Varieties of finite monoids and Büchi-McNaughton theorem
type: Item
instance of: scholarly article
title: Varieties of finite monoids and Büchi-McNaughton theorem
zbMATH Open document ID: 0761.68049
DOI: 10.1016/0304-3975(92)90006-2
author: Do Long Van
author: Phan Trung Huy
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 65319
zbMATH Keywords: varieties of recognizable languages
MaRDI profile type: Publication
full work available at URL: 0304-3975(92)90006-2
OpenAlex ID: W2041155655
cites work: Rational \(\omega\)-languages are non-ambiguous
cites work: Codeterministic automata on infinite words
cites work: Q4132170
cites work: Ensembles Reconnaissables de Mots Biinfinis
cites work: Q4741717
cites work: Q3698327
cites work: Aperiodic homomorphisms and the concatenation product of recognizable sets
cites work: Star-free regular sets of ω-sequences
description: scientific article; zbMATH DE number 65319