Sciweavers

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

11

LICS
2008
IEEE

favoriteEmaildiscussreport

95views Automated Reasoning» more LICS 2008»

Piecewise Testable Tree Languages

13 years 11 months ago

Piecewise Testable Tree Languages

Download www.lsv.ens-cachan.fr

— This paper presents a decidable characterization of tree languages that can be deﬁned by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem, which says that a string language can be deﬁned by a boolean combination of Σ1 formulas if and only if its syntactic monoid is J-trivial.

Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing

Real-time Traffic

Boolean Combination | Computer Science | Decidable Characterization | LICS 2008 | Σ1 Formulas |

claim paper

Related Content

» A Decidable Characterization of Locally Testable Tree Languages

» Hierarchies of Piecewise Testable Languages

» Effective characterizations of tree logics

» Spider Diagrams of Order

» Classifying Regular Languages via Cascade Products of Automata

» Approximate schemas sourceconsistency and query answering

» Associative language descriptions

Post Info
More Details (n/a)

Added	31 May 2010
Updated	31 May 2010
Type	Conference
Year	2008
Where	LICS
Authors	Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing

Comments (0)