Rabin tree automata and finite monoids
type: Item
instance of: scholarly article
title: Rabin tree automata and finite monoids
zbMATH Open document ID: 0823.68064
DOI: 10.1016/0304-3975(94)90275-5
author: Danièle Beauquier
author: Andreas Podelski
published in: Theoretical Computer Science
publication date: 1995-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 708717
zbMATH Keywords: finite monoids
zbMATH Keywords: \(\omega\)-tree languages
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90275-5
OpenAlex ID: W2061287496
cites work: Q5525343
cites work: Q4385540
cites work: Q3993363
cites work: Q3752578
cites work: On reverse and general definite tree languages
cites work: Q3698327
cites work: Q3776657
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q4273660
cites work: Q3221429
cites work: Q4385530
description: scientific article; zbMATH DE number 708717