Sciweavers

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

35

FOSSACS
2007
Springer

favoriteEmaildiscussreport

88views Software Engineering» more FOSSACS 2007»

Tree Automata with Memory, Visibility and Structural Constraints

14 years 5 months ago

Tree Automata with Memory, Visibility and Structural Constraints

Download www.lsv.ens-cachan.fr

Tree automata with one memory have been introduced in

Hubert Comon-Lundh, Florent Jacquemard, Nicolas Pe

Real-time Traffic

Applied Computing | FOSSACS 2007 | Tree Automata |

claim paper

Related Content

» Visibly Tree Automata with Memory and Constraints

» Proving Group Protocols Secure Against Eavesdroppers

» Streaming tree automata

» Automatabased verification of programs with tree updates

» Tree pattern mining with tree automata constraints

» Constraint Automata and the Complexity of Recursive Subtype Entailment

» Constraintbased Tree Pattern Mining

» Parallelism Constraints

» Automated Induction with Constrained Tree Automata

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	FOSSACS
Authors	Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Comments (0)