From regular expressions to deterministic automata
Theoretical Computer Science
Regular expressions into finite automata
Theoretical Computer Science
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity results for two-way and multi-pebble automata and their logics
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On some variations of two-way probabilistic finite automata models
Theoretical Computer Science
Note: Schützenberger's theorem on formal power series follows from Kleene's theorem
Theoretical Computer Science
Language and Automata Theory and Applications
Weighted versus Probabilistic Logics
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
A Weighted μ-Calculus on Words
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Elements of Automata Theory
Handbook of Weighted Automata
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Pebble weighted automata and transitive closure logics
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Expressive power of pebble automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Weighted specifications over nested words
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
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 |
We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-Schützenberger theorem showing that weighted expressions and automata with pebbles have the same expressive power. We focus on an efficient translation from expressions to automata. We also prove that the evaluation problem for weighted automata can be done very efficiently if the number of (reusable) pebbles is low.