Varieties of recognizable tree series over fields

DOI10.1016/j.tcs.2010.11.018zbMath1220.68067MaRDI QIDQ627171

Zoltán Fülöp, Magnus Steinby

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.018

zbMATH Keywords

tree languages; \(K\Sigma\)-algebras; syntactic algebras; tree series; varieties of tree series; variety theorem

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Cites Work

• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• The rank of a formal tree power series
• Existential MSO over two successors is strictly weaker than over linear orders
• Effective construction of the syntactic algebra of a recognizable series on trees
• Varieties of formal series on trees and Eilenberg's theorem
• A characterization of attributed tree transformations by a subclass of macro tree transducers
• Series formelles et algèbres syntactiques
• Recognizable formal power series on trees
• Positive varieties of tree languages
• Représentations matricielles des séries d'arbre reconnaissables
• On the syntactic complexity of tree series
• Definable Transductions and Weighted Logics for Texts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item