Definable transductions and weighted logics for texts
From MaRDI portal
Publication:844894
DOI10.1016/j.tcs.2009.09.040zbMath1184.68322OpenAlexW2031074658MaRDI QIDQ844894
Publication date: 5 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.040
monadic second-order logicweighted automataweighted logicstextsbranching automataMSO-definable transductionsparenthesizing automatarecognizable series
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items
Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ Weighted automata
Cites Work
- Basic notions of universal algebra for language theory and graph grammars
- T-structures, T-functions, and texts
- Branching automata with costs -- a way of reflecting parallelism in costs
- The rank of a formal tree power series
- Handbook of weighted automata
- Existential MSO over two successors is strictly weaker than over linear orders
- Effective construction of the syntactic algebra of a recognizable series on trees
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Series formelles et algèbres syntactiques
- On some questions of rationality and decidability
- On rational series and rational languages
- Context-free text grammars
- Monadic second-order definable graph transductions: a survey
- Monadic second-order definable text languages
- Regular binoid expressions and regular binoid languages.
- On transformations of formal power series.
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Formal series over sorted algebras
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Rationality in algebras with a series operation
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Tree acceptors and some of their applications
- Représentations matricielles des séries d'arbre reconnaissables
- Weak Second‐Order Arithmetic and Finite Automata
- On the definition of a family of automata
- Weighted Logics for Traces
- Deciding Equivalence of Finite Tree Automata
- Weighted Automata and Weighted Logics with Discounting
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Learning Multiplicity Tree Automata
- Weighted Automata and Weighted Logics on Infinite Words
- Decision Problems of Finite Automata Design and Related Arithmetics
- Some remarks on recognizable treeseries
- MSO definable string transductions and two-way finite-state transducers
- Learning functions represented as multiplicity automata
- Mathematical Foundations of Computer Science 2004
- Definable Transductions and Weighted Logics for Texts
- Weighted Distributed Systems and Their Logics
- Weighted Picture Automata and Weighted Logics
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Algebraic automata and context-free sets
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Automata, Languages and Programming
- 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
