scientific article; zbMATH DE number 475413

zbMath0798.68087MaRDI QIDQ4273660

Magnus Steinby

Publication date: 13 January 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

monoidssyntactic algebrastree language varietiesvarieties of finite algebras

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70)

Related Items (18)

Rabin tree automata and finite monoids ⋮ Recognisable Languages over Monads ⋮ Axiomatizing the equational theory of regular tree languages ⋮ A positive extension of Eilenberg's variety theorem for non-regular languages ⋮ Tree algebras and varieties of tree languages ⋮ First-order logic on finite trees ⋮ Varieties of recognizable tree series over fields ⋮ Classifying regular languages by their syntactic algebras ⋮ Aperiodicity in Tree Automata ⋮ Algebras for classifying regular tree languages and an application to frontier testability ⋮ An algebraic characterization of frontier testable tree languages ⋮ Idempotent tree languages ⋮ Algebraic recognizability of regular tree languages ⋮ Recognisability for algebras of infinite trees ⋮ Characterizing CTL-like logics on finite trees. ⋮ On reverse and general definite tree languages ⋮ General varieties of tree languages ⋮ Positive varieties of tree languages

This page was built for publication: