Theoretical Computer Science
Axiomatizing rational power series over natural numbers
Information and Computation
Cycle-Free Finite Automata in Partial Iterative Semirings
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Definable transductions and weighted logics for texts
Theoretical Computer Science
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
Weighted and unweighted trace automata
Acta Cybernetica
A play on regular expressions: functional pearl
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Pebble weighted automata and transitive closure logics
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Mean-payoff automaton expressions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Kleene, Rabin, and Scott are available
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Regular expressions on average and in the long run
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Minimizing deterministic lattice automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Ancient typefaces and parametric weighted finite automata
Rainbow of computer science
A unifying Kleene theorem for weighted finite automata
Rainbow of computer science
Joint spectral radius theory for automated complexity analysis of rewrite systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
A cascade decomposition of weighted finite transition systems
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Solving fixed-point equations by derivation tree analysis
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A counterexample to tensorability of effects
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
On the supports of recognizable series over a field and a single letter alphabet
Information Processing Letters
Multi-Linear Iterative K-Σ-Semialgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Coping with selfish on-going behaviors
Information and Computation
From n-gram-based to CRF-based translation models
WMT '11 Proceedings of the Sixth Workshop on Statistical Machine Translation
A coalgebraic perspective on linear weighted automata
Information and Computation
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Hierarchical phrase-based translation representations
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
On algebra of languages representable by vertex-labeled graphs
Theoretical Computer Science
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
Compositional reasoning for markov decision processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
The complexity of mean-payoff automaton expression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Weighted Extended Tree Transducers
Fundamenta Informaticae
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Minimal DFA for symmetric difference NFA
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
A macroscopic approach to FCA and its various fuzzifications
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Probabilistic automata and probabilistic logic
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding the twins property for weighted tree automata over extremal semifields
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Grammar-based test generation for software product line feature models
CASCON '12 Proceedings of the 2012 Conference of the Center for Advanced Studies on Collaborative Research
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
A pushdown transducer extension for the openfst library
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Weighted modal transition systems
Formal Methods in System Design
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative reactive modeling and verification
Computer Science - Research and Development
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression. This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research. The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory. Part II investigates different concepts of weighted recognizability. Part III examines alternative types of weighted automata and various discrete structures other than words. Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing. Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.