Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICALP
2010
Springer

favoriteEmaildiscussreport

121views Programming Languages» more ICALP 2010»

Pebble Weighted Automata and Transitive Closure Logics

13 years 9 months ago

Pebble Weighted Automata and Transitive Closure Logics

Download www.lsv.ens-cachan.fr

Benedikt Bollig, Paul Gastin, Benjamin Monmege, Ma

Real-time Traffic

ICALP 2010 | Programming Languages |

claim paper

Related Content

» Automata with Nested Pebbles Capture FirstOrder Logic with Transitive Closure

» XPath transitive closure logic and nested tree walking automata

» Transitive closure logic nested tree walking automata and XPath

» Expressiveness and Closure Properties for Quantitative Languages

» Max and Sum Semantics for Alternating Weighted Automata

» Alternating Weighted Automata

» Probabilistic Weighted Automata

» Variable Automata over Infinite Alphabets

» On the Power of TreeWalking Automata

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	ICALP
Authors	Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun

Comments (0)