Characterizations of recognizable weighted tree languages by logic and bimorphisms
From MaRDI portal
Publication:1797776
DOI10.1007/s00500-015-1717-2zbMath1398.68308OpenAlexW862698644MaRDI QIDQ1797776
Publication date: 22 October 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1717-2
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Weighted tree automata and weighted logics
- Weighted grammars and Kleene's theorem
- Recognizable formal power series on trees
- Transductions des langages de Chomsky
- General varieties of tree languages
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- A link between multioperator and tree valuation automata and logics
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Tree acceptors and some of their applications
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- Bottom-up and top-down tree transformations— a comparison
- Weighted Tree Automata and Tree Transducers
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Automata, Languages and Programming
This page was built for publication: Characterizations of recognizable weighted tree languages by logic and bimorphisms
