Definable transductions and weighted logics for texts
From MaRDI portal
Publication:844894
Recommendations
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 4016220 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 176754 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- scientific article; zbMATH DE number 2068875 (Why is no real title available?)
- scientific article; zbMATH DE number 1478125 (Why is no real title available?)
- scientific article; zbMATH DE number 1502105 (Why is no real title available?)
- scientific article; zbMATH DE number 2143010 (Why is no real title available?)
- scientific article; zbMATH DE number 871246 (Why is no real title available?)
- scientific article; zbMATH DE number 2211801 (Why is no real title available?)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Algebraic automata and context-free sets
- Automata, Languages and Programming
- Basic notions of universal algebra for language theory and graph grammars
- Branching automata with costs -- a way of reflecting parallelism in costs
- Context-free text grammars
- Deciding Equivalence of Finite Tree Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Definable Transductions and Weighted Logics for Texts
- Effective construction of the syntactic algebra of a recognizable series on trees
- Existential MSO over two successors is strictly weaker than over linear orders
- Finitary compositions of two-way finite-state transductions
- Formal series of general algebras over a field and their syntactic algebras
- Formal series over sorted algebras
- Free algebras for generalized automata and language theory
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Handbook of weighted automata
- Learning Multiplicity Tree Automata
- Learning functions represented as multiplicity automata
- MSO definable string transductions and two-way finite-state transducers
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Mathematical Foundations of Computer Science 2004
- Monadic second-order definable graph transductions: a survey
- Monadic second-order definable text languages
- On rational series and rational languages
- On some questions of rationality and decidability
- On the definition of a family of automata
- On transformations of formal power series.
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Rationality in algebras with a series operation
- Regular binoid expressions and regular binoid languages.
- Représentations matricielles des séries d'arbre reconnaissables
- Series formelles et algèbres syntactiques
- Some remarks on recognizable treeseries
- T-structures, T-functions, and texts
- The rank of a formal tree power series
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted Automata and Weighted Logics with Discounting
- Weighted Distributed Systems and Their Logics
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted Logics for Traces
- Weighted Muller tree automata and weighted logics
- Weighted Picture Automata and Weighted Logics
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Łukasiewicz logic and weighted logics over MV-semirings
Cited in
(5)
This page was built for publication: Definable transductions and weighted logics for texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844894)
