Sciweavers

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

8

FSTTCS
2004
Springer

favoriteEmaildiscussreport

89views Software Engineering» more FSTTCS 2004»

Alternation in Equational Tree Automata Modulo XOR

13 years 9 months ago

Alternation in Equational Tree Automata Modulo XOR

Download www2.cs.tum.edu

Kumar Neeraj Verma

Real-time Traffic

FSTTCS 2004 |

claim paper

Related Content

» Tree Automata with Equality Constraints Modulo Equational Theories

» Languages Modulo Normalization

» A Sufficient Completeness Checker for Linear OrderSorted Specifications Modulo Axioms

» Alternating twoway ACtree automata

» Equational approximations for tree automata completion

» Regular Cost Functions over Finite Trees

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	FSTTCS
Authors	Kumar Neeraj Verma

Comments (0)