Adding pebbles to weighted automata: easy specification \& efficient evaluation
From MaRDI portal
Publication:2447753
DOI10.1016/j.tcs.2014.02.034zbMath1359.68167OpenAlexW2044309595MaRDI QIDQ2447753
Publication date: 29 April 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.034
weighted automataweighted expressionsKleene-Schützenberger theoremreusable pebblesspecification of weighted properties
Related Items (2)
Two-way representations and weighted automata ⋮ Two-way pebble transducers for partial functions and their composition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Handbook of weighted automata
- On some variations of two-way probabilistic finite automata models
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- Regular expressions into finite automata
- Complexity results for two-way and multi-pebble automata and their logics
- Automata and rational expressions
- Adding Pebbles to Weighted Automata
- Weighted LTL with Discounting
- On the definition of a family of automata
- THE ABSTRACT THEORY OF AUTOMATA
- Tree-Walking Automata
- Pebble Weighted Automata and Transitive Closure Logics
- Expressive Power of Pebble Automata
- Weighted versus Probabilistic Logics
- A Weighted μ-Calculus on Words
- Semirings and Formal Power Series
- Rational and Recognisable Power Series
- State-complexity of finite-state devices, state compressibility and incompressibility
- Complexity of Pebble Tree-Walking Automata
- Lattice Automata
- Boolean Matrices and the Stability of Neural Nets
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Model checking for a class of weighted automata
This page was built for publication: Adding pebbles to weighted automata: easy specification \& efficient evaluation
