An algebraic characterization of frontier testable tree languages
type: Item
instance of: scholarly article
title: An algebraic characterization of frontier testable tree languages
zbMATH Open document ID: 0871.68110
DOI: 10.1016/0304-3975(95)00131-X
author: Thomas Wilke
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 985232
zbMATH Keywords: pseudoidentities for tree algebras
zbMATH Keywords: efficient algorithm
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
cites work: Q3934450
cites work: A geometrical view of the determinization and minimization of finite-state automata
cites work: Q4132170
cites work: Q3221381
cites work: Q3975149
cites work: Q3833629
cites work: Q3769981
cites work: On reverse and general definite tree languages
cites work: The Birkhoff theorem for finite algebras
cites work: Q4273660
cites work: Algebras for classifying regular tree languages and an application to frontier testability
description: scientific article; zbMATH DE number 985232