The congruence theory of closure properties of regular tree languages
type: Item
instance of: scholarly article
title: The congruence theory of closure properties of regular tree languages
zbMATH Open document ID: 0704.68070
DOI: 10.1016/0304-3975(90)90020-I
author: Seppo Tirri
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 4155908
zbMATH Keywords: regular tree languages
zbMATH Keywords: finite tree automata
zbMATH Keywords: finite recognizers
zbMATH Keywords: regular grammars
zbMATH Keywords: recognizable forests
MaRDI profile type: Publication
cites work: Algebra automata I: Parallel programming as a prolegomena to the categorical approach
cites work: The minimalization of tree automata
cites work: Q3934450
cites work: Q4179852
cites work: Q5678435
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
Recommended article: Closure of Tree Automata Languages under Innermost Rewriting
Recommended article: Closure properties of linear context-free tree languages with an application to optimality theory
Recommended article: Congruences, homomorphisms and languages of tree automata
Recommended article: Axiomatizing the equational theory of regular tree languages
Recommended article: On Topological Completeness of Regular Tree Languages
Recommended article: Q3792261
Recommended article: Test sets for the universal and existential closure of regular tree languages.
Recommended article: Closure properties and complexity of rational sets of regular languages
Recommended article: Q4938607
Recommended article: Q4381396
description: scientific article; zbMATH DE number 4155908