Principal abstract families of weighted tree languages

DOI10.1016/j.ic.2020.104657OpenAlexW3100785150MaRDI QIDQ2064529

Heiko Vogler, Zoltán Fülöp

Publication date: 6 January 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2020.104657

zbMATH Keywords

weighted tree automataabstract families of languagesgrammars with storage

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• Pushdown machines for the macro tree transducer
• Weighted grammars and Kleene's theorem
• High level tree transducers and iterated pushdown tree transducers
• The IO- and OI-hierarchies
• Recognizable formal power series on trees
• Iterated stack automata and complexity classes
• IO and OI. I
• IO and OI. II
• On two families of forests
• A Kleene theorem for weighted tree automata
• Algebraic aspects of families of fuzzy languages
• Rational weighted tree languages with storage and the Kleene-Goldstine theorem
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
• Weighted automata with storage
• Fuzzy tree automata
• Some definitional suggestions for automata theory
• Principal AFL
• Proof of correctness of data representations
• A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
• On the definition of a family of automata
• Introduction to Boolean Algebras
• Formal Languages and Groups as Memory
• An automata-theoretical characterization of the OI-hierarchy
• Stack Machines and Classes of Nonnested Macro Languages
• Composition of top-down and bottom-up tree transductions
• The algebraic equivalent of AFL theory
• Semirings and Formal Power Series
• Weighted Tree Automata and Tree Transducers
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Tree generating regular systems
• One-way stack automata
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata
• Full AFLs and nested iterated substitution
• Studies in abstract families of languages

This page was built for publication: Principal abstract families of weighted tree languages