Sciweavers

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

11

ICALP
2009
Springer

favoriteEmaildiscussreport

100views Programming Languages» more ICALP 2009»

A Decidable Characterization of Locally Testable Tree Languages

14 years 4 months ago

A Decidable Characterization of Locally Testable Tree Languages

Download www.lsv.ens-cachan.fr

Thomas Place, Luc Segoufin

Real-time Traffic

ICALP 2009 | Testable Tree Languages | Theoretical Computer Science |

claim paper

Related Content

» Piecewise Testable Tree Languages

» Effective characterizations of tree logics

» A new algorithm for testing if a regular language is locally threshold testable

» Approximate schemas sourceconsistency and query answering

» Classifying Regular Languages via Cascade Products of Automata

» Characterizing EF and EX Tree Logics

» On Decidability Properties of Local Sentences

» Rigid Tree Automata

» Associative language descriptions

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2009
Where	ICALP
Authors	Thomas Place, Luc Segoufin

Comments (0)