Automata, Languages and Programming
From MaRDI portal
Publication:5716802
DOI10.1007/11523468zbMath1084.03036OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716802
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items (36)
Crisp-determinization of weighted tree automata over strong bimonoids ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Weighted automata and weighted logics ⋮ Definable transductions and weighted logics for texts ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Weighted tree automata and weighted logics ⋮ Weighted Automata and Weighted Logics ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Weighted Automata and Weighted Logics with Discounting ⋮ Weighted two-way transducers ⋮ Weighted two-way transducers ⋮ Unnamed Item ⋮ Automata theory based on lattice-ordered semirings ⋮ Weighted logics for unranked tree automata ⋮ Weighted picture automata and weighted logics ⋮ Modal transition systems with weight intervals ⋮ Unnamed Item ⋮ Weighted monadic Datalog ⋮ Determinization of fuzzy automata with membership values in complete residuated lattices ⋮ Multi-weighted automata and MSO logic ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ Quantitative Kleene coalgebras ⋮ Pebble Weighted Automata and Weighted Logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Freeness properties of weighted and probabilistic automata over bounded languages ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Weighted Symbolic Automata with Data Storage ⋮ Weighted Timed MSO Logics ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Unnamed Item ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields ⋮ Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures ⋮ Characterizing weighted MSO for trees by branching transitive closure logics
This page was built for publication: Automata, Languages and Programming
