Automata, Languages and Programming
From MaRDI portal
Publication:5716802
DOI10.1007/11523468zbMath1084.03036WikidataQ56656999 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
03D05: Automata and formal grammars in connection with logical questions
68Q70: Algebraic theory of languages and automata
Related Items
Unnamed Item, Unnamed Item, Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures, Pebble Weighted Automata and Weighted Logics, Automata theory based on lattice-ordered semirings, Modal transition systems with weight intervals, Multi-weighted automata and MSO logic, Quantitative Kleene coalgebras, A Büchi-like theorem for weighted tree automata over multioperator monoids, Weighted automata and multi-valued logics over arbitrary bounded lattices, Definable transductions and weighted logics for texts, Weighted tree automata and weighted logics, Weighted monadic Datalog, Characterizations of recognizable weighted tree languages by logic and bimorphisms, Weighted automata and weighted MSO logics for average and long-time behaviors, Freeness properties of weighted and probabilistic automata over bounded languages, TFHE: fast fully homomorphic encryption over the torus, Characterizing weighted MSO for trees by branching transitive closure logics, Weighted automata and weighted logics, Weighted logics for unranked tree automata, Weighted picture automata and weighted logics, Determinization of fuzzy automata with membership values in complete residuated lattices, Weighted Symbolic Automata with Data Storage, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Deriving Syntax and Axioms for Quantitative Regular Behaviours, Unnamed Item, Weighted Automata and Weighted Logics with Discounting, Weighted Timed MSO Logics
