Definable transductions and weighted logics for texts
type: Item
instance of: scholarly article
title: Definable transductions and weighted logics for texts
zbMATH Open document ID: 1184.68322
author: Christian Mathissen
published in: Theoretical Computer Science
publication date: 2010-02-05T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 5666094
zbMATH Keywords: weighted automata
zbMATH Keywords: weighted logics
zbMATH Keywords: monadic second-order logic
zbMATH Keywords: MSO-definable transductions
zbMATH Keywords: parenthesizing automata
zbMATH Keywords: branching automata
zbMATH Keywords: recognizable series
zbMATH Keywords: texts
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.040
OpenAlex ID: W2031074658
cites work: Learning functions represented as multiplicity automata
cites work: Q3994777
cites work: A comparison of tree transductions defined by monadic second order logic and by attribute grammars
cites work: Weighted Distributed Systems and Their Logics
cites work: Q5694616
cites work: Effective construction of the syntactic algebra of a recognizable series on trees
cites work: Représentations matricielles des séries d'arbre reconnaissables
cites work: The rank of a formal tree power series
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Monadic second-order definable graph transductions: a survey
cites work: Basic notions of universal algebra for language theory and graph grammars
cites work: Tree acceptors and some of their applications
cites work: Weighted automata and weighted logics
cites work: Automata, Languages and Programming
cites work: Handbook of weighted automata
cites work: Weighted Automata and Weighted Logics on Infinite Words
cites work: Weighted Automata and Weighted Logics with Discounting
cites work: Weighted logics for unranked tree automata
cites work: On transformations of formal power series.
cites work: Q4492680
cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms
cites work: T-structures, T-functions, and texts
cites work: Context-free text grammars
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: MSO definable string transductions and two-way finite-state transducers
cites work: Q5431915
cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations.
cites work: Free algebras for generalized automata and language theory
cites work: Q4449537
cites work: Q4654639
cites work: Q3655364
cites work: Q4179852
cites work: Learning Multiplicity Tree Automata
cites work: Q4503146
cites work: Q4465336
cites work: Regular binoid expressions and regular binoid languages.
cites work: Q4874660
cites work: Monadic second-order definable text languages
cites work: Q3028363
cites work: Formal series over sorted algebras
cites work: Q3704880
cites work: Branching automata with costs -- a way of reflecting parallelism in costs
cites work: Q2770573
cites work: Rationality in algebras with a series operation
cites work: Some remarks on recognizable treeseries
cites work: RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
cites work: Definable Transductions and Weighted Logics for Texts
cites work: Weighted Logics for Nested Words and Algebraic Formal Power Series
cites work: Existential MSO over two successors is strictly weaker than over linear orders
cites work: Weighted Picture Automata and Weighted Logics
cites work: Weighted Logics for Traces
cites work: Algebraic automata and context-free sets
cites work: Q3683903
cites work: Q3515223
cites work: Series formelles et algèbres syntactiques
cites work: Q4155837
cites work: On the definition of a family of automata
cites work: Q3515224

Definable transductions and weighted logics for texts (cites work)
cites work: Deciding Equivalence of Finite Tree Automata

Definable transductions and weighted logics for texts (cites work)
cites work: On some questions of rationality and decidability

Definable transductions and weighted logics for texts (cites work)
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic

Definable transductions and weighted logics for texts (cites work)
cites work: Q4036584

Definable transductions and weighted logics for texts (cites work)
cites work: On rational series and rational languages

Definable transductions and weighted logics for texts (cites work)
cites work: Mathematical Foundations of Computer Science 2004

Definable transductions and weighted logics for texts (DOI)
DOI: 10.1016/J.TCS.2009.09.040