Formal Methods for XML: Algorithms & Complexity

Transcription

1 Forml Methods for XML: Algorithms & Complexity S. Mrgherit di Pul August 2004 Thoms Shwentik

2 Shwentik XML: Algorithms & Complexity Introdution 1 XML Exmple Doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

3 Shwentik XML: Algorithms & Complexity Introdution 1 XML Exmple Tree Nme Clude Debussy Born When 1862 Where Pris Composer Vit Mrried Mrried When 1899 Whom Roslie When 1908 Whom Emm Died When 1918 Where Pris PTitle L Mer Piee PYer 1905 Instruments Lrge orhestr Movements 3

4 Shwentik XML: Algorithms & Complexity Introdution 2 XML Proessing Four importnt kinds of XML proessing Vlidtion Chek whether n XML doument is of given type Nvigtion Selet set of positions in n XML doument Querying Extrt informtion from n XML doument Trnsformtion Construt new XML doument from given one

5 Shwentik XML: Algorithms & Complexity Introdution 2 XML Proessing Four importnt kinds of XML proessing nd their lnguges Vlidtion DTD, XML Shem Chek whether n XML doument is of given type Nvigtion XPth Selet set of positions in n XML doument Querying XQuery Extrt informtion from n XML doument Trnsformtion XSLT Construt new XML doument from given one

6 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 3 Vlidtion: DTD Exmple doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

7 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 3 Vlidtion: DTD Exmple doument DTD DTDs desribe types of XML douments Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

8 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 3 Vlidtion: DTD Exmple doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer... DTD DTDs desribe types of XML douments Exmple <!DOCTYPE Composers [ <!ELEMENT Composers (Composer*)> <!ELEMENT Composer (Nme, Vit, Piee*)> <!ELEMENT Vit (Born, Mrried*, Died?)> <!ELEMENT Born (When, Where)> <!ELEMENT Mrried (When, Whom)> <!ELEMENT Died (When, Where)> <!ELEMENT Piee (PTitle, PYer, Instruments, Movements)> ]>

9 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 4 Nvigtion: XPth Exmple doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

10 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 4 Composer Nme Clude Debussy /Nme Vit Nvigtion: XPth XPth XPth expressions selet sets of nodes of Exmple doument XML douments by speifying nvigtionl ptterns Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

11 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 4 Composer Nme Clude Debussy /Nme Vit Nvigtion: XPth Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer... XPth XPth expressions selet sets of nodes of Exmple doument XML douments by speifying nvigtionl ptterns Exmple query //Vit/Died/*

12 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 4 Composer Nme Clude Debussy /Nme Vit Nvigtion: XPth Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer... XPth XPth expressions selet sets of nodes of Exmple doument XML douments by speifying nvigtionl ptterns /Died Exmple query //Vit/Died/*

13 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 5 Querying: XQuery Exmple doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

14 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 5 Querying: XQuery Exmple doument XQuery XQuery is full-fledged XML query lnguge Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

15 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 5 Querying: XQuery Exmple doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer... XQuery XQuery is full-fledged XML query lnguge Exmple query for $x in do( omposers.xml )/Composer where $x/vit/died/where = Pris return $x/nme

16 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 5 Querying: XQuery Exmple doument Composer Nme Hetor Berlioz /Nme Nme Clude Debussy /Nme Nme Cmille Sint-Sëns /Nme Vit Nme Born Frédéri When August Chopin 22, /Nme 1862 /When Where Pris /Where /Born Nme Mrried When Murie Rvel Otober /Nme 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Nme Jim Morrison /Nme Died When Mrh 25, 1918 /When Where Pris /Where /Died Nme /Vit Césr Frnk /Nme Nme Piee Gbriel Furé /Nme Nme PTitle George L Mer Bizet /PTitle /Nme PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer... Result Nme Clude Debussy /Nme Nme Eri Stie /Nme... XQuery XQuery is full-fledged XML query lnguge Exmple query for $x in do( omposers.xml )/Composer where $x/vit/died/where = Pris return $x/nme

17 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 6 Trnsformtion: XSLT Exmple doument Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

18 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 6 Trnsformtion: XSLT XSLT XSLT trnsforms douments by Exmple doument mens of templtes Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer...

19 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 6 Trnsformtion: XSLT XSLT XSLT trnsforms douments by Exmple doument mens of templtes Composer Nme Clude Debussy /Nme Vit Born When August 22, 1862 /When Where Pris /Where /Born Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Died When Mrh 25, 1918 /When Where Pris /Where /Died /Vit Piee PTitle L Mer /PTitle PYer 1905 /PYer Instruments Lrge orhestr /Instruments Movements 3 /Movements... /Piee... /Composer... Exmple xsl:templte mth= Composer[Vit//Where= Pris ] PrisComposer xsl:opy-of selet= Nme / xsl:opy-of selet= Vit/Born / /PrisComposer /xsl:templte

20 Result Trnsformtion: XSLT XSLT XSLT trnsforms douments by Exmple doument mens of templtes PrisComposer Nme Clude Debussy /Nme Composer Born Nme When Clude August Debussy 22, 1862 /Nme /When Vit Where Pris /Where /Born Born When August 22, 1862 /When Where Pris /Where /Born /PrisComposer Mrried When Otober 1899 /When Whom Roslie /Whom /Mrried PrisComposer Mrried When Jnury 1908 /When Whom Emm /Whom /Mrried Nme Died When FrédériMrh Chopin 25, /Nme 1918 /When Where Pris /Where /Died /Vit Born Piee When Mrh 1, 1810 /When PTitle Where LŽelzow Mer /PTitle /Where /Born PYer 1905 /PYer Exmple /PrisComposer Instruments Lrge orhestr /Instruments PrisComposer Movements 3 /Movements Nme... Cmille Sint-Sëns /Nme PrisComposer /Piee Born xsl:opy-of selet= Nme /... When Otober 9, 1835 /When xsl:opy-of selet= Vit/Born / /Composer Where Pris /Where /PrisComposer... /Born /xsl:templte /PrisComposer xsl:templte mth= Composer[Vit//Where= Pris ] Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 6

21 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 7 A Shemti View DTD/ XML Shem XPth yes/no XQuery XSLT

22 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 8 Fous of this Tlk Topis Expressive power of XML lnguges Complexity of lgorithmi tsks relted to XML proessing Trdeoff between expressiveness nd omplexity Gols of this Reserh Understnd expressive power nd omplexity of XML lnguges Identify interesting frgments with good trdeoff

23 Algorithmi Tsks Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 9

24 Evlution Evlution (Combined) I: Tree t, Query q O: q(t) Algorithmi Tsks Stti Anlysis Stisfibility I: Query q Q: Is q(t) for some t? Evlution (Dt(q)) I: Tree t O: q(t) Inrementl Evl. (q) I: Tree t, Chnges of t O: q(t) Continment I: Queries q 1, q 2 Q: Is lwys q 1 (t) q 2 (t)? Type Cheking I: Types d 1, d 2, Trnsformtion T Q: Does t = d 1 imply T (t) = d 2? Equivlene I: Queries q 1, q 2 Q: Is lwys q 1 (t) = q 2 (t)? Type Inferene Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 10

25 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 11 Expressive power Question: How do we mesure expressive power? Remrks Clsses of logil formuls re good yrdstik They provide methods to prove tht query n not be expressed

26 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 11 Expressive power Question: How do we mesure expressive power? Remrks Clsses of logil formuls re good yrdstik They provide methods to prove tht query n not be expressed Rell Reltionl Dtbses Core of SQL First-order Logi Most frequently sked queries Conjuntive queries

27 Contents Introdution Bkground on Tree Automt nd Logi Shem Lnguges XPth nd Node-seleting Queries XSLT XQuery Conlusion

28 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 13 Deidble Bkground: Complexity Clsses Overview of Complexity Clsses EXPSPACE EXPTIME PSPACE Equivlene of reg. expressions with squring Plyer Corridor Tiling Quntified Boolen Formuls onp NP Stisfibility of prop. formuls P NC LOGCFL NL LOGSPACE Boolen iruit evlution Effiiently prllelizble problems Ayli onjuntive queries Rehbility in direted grphs Rehbility in direted forests

29 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 14 XML, Trees nd Automt Question: Why is XML ppeling for Theory people?

30 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 14 XML, Trees nd Automt Question: Why is XML ppeling for Theory people? Yers go... Theoretil Computer Siene for Dtbse Theorists: Logis, Complexity, Algorithms,... Dtbse Theory for Theoretil Computer Sientists:

31 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 14 XML, Trees nd Automt Question: Why is XML ppeling for Theory people? Yers go... Theoretil Computer Siene for Dtbse Theorists: Logis, Complexity, Algorithms,... Dtbse Theory for Theoretil Computer Sientists: terr inognit

32 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 14 XML, Trees nd Automt Question: Why is XML ppeling for Theory people? Yers go... Theoretil Computer Siene for Dtbse Theorists: Logis, Complexity, Algorithms,... Dtbse Theory for Theoretil Computer Sientists: terr inognit After the dvent of XML Mny onnetions between Forml Lnguges & Automt Theory nd XML & Dtbse Theory

33 XML, Trees nd Automt Question: Why trees? Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 15

34 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 15 XML, Trees nd Automt Question: Why trees? A Nturl Answer Trees reflet the hierrhil struture of XML Underlying dt model of XML is tree bsed

35 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 15 XML, Trees nd Automt Question: Why trees? A Nturl Answer Trees reflet the hierrhil struture of XML Underlying dt model of XML is tree bsed Limittions But trees n not model ll spets of XML (e.g., IDREFs, dt vlues) Sometimes extensions re needed E.g., direted grphs insted of trees

36 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 15 XML, Trees nd Automt Question: Why trees? A Nturl Answer Trees reflet the hierrhil struture of XML Underlying dt model of XML is tree bsed Limittions But trees n not model ll spets of XML (e.g., IDREFs, dt vlues) Sometimes extensions re needed E.g., direted grphs insted of trees Exmple

37 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 15 XML, Trees nd Automt Question: Why trees? A Nturl Answer Trees reflet the hierrhil struture of XML Underlying dt model of XML is tree bsed Limittions But trees n not model ll spets of XML (e.g., IDREFs, dt vlues) Sometimes extensions re needed E.g., direted grphs insted of trees Exmple

38 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 15 XML, Trees nd Automt Question: Why trees? A Nturl Answer Trees reflet the hierrhil struture of XML Underlying dt model of XML is tree bsed Limittions But trees n not model ll spets of XML (e.g., IDREFs, dt vlues) Sometimes extensions re needed E.g., direted grphs insted of trees Exmple Nevertheless In this tutoril we will onentrte on the tree view t XML

39 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 16 XML, Trees nd Automt Question: Why utomt? Ingredients of XML Conepts from forml lnguges re obviously present round XML: Lbelled trees DTD: ontext-free grmmrs DTD: regulr expressions XPth: regulr pth expressions We will see Automt turn out to be useful s: mens to define robust lsses with ler semntis tool for proofs n lgorithmi tool for stti nlysis tool for query evlution

40 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 16 XML, Trees nd Automt Question: Why utomt? Ingredients of XML Conepts from forml lnguges re obviously present round XML: Lbelled trees DTD: ontext-free grmmrs DTD: regulr expressions XPth: regulr pth expressions We will see Automt turn out to be useful s: mens to define robust lsses with ler semntis tool for proofs n lgorithmi tool for stti nlysis tool for query evlution

41 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 16 XML, Trees nd Automt Question: Why utomt? Ingredients of XML Conepts from forml lnguges re obviously present round XML: Lbelled trees DTD: ontext-free grmmrs DTD: regulr expressions XPth: regulr pth expressions We will see Automt turn out to be useful s: mens to define robust lsses with ler semntis tool for proofs n lgorithmi tool for stti nlysis tool for query evlution

42 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 16 XML, Trees nd Automt Question: Why utomt? Ingredients of XML Conepts from forml lnguges re obviously present round XML: Lbelled trees DTD: ontext-free grmmrs DTD: regulr expressions XPth: regulr pth expressions We will see Automt turn out to be useful s: mens to define robust lsses with ler semntis tool for proofs n lgorithmi tool for stti nlysis tool for query evlution

43 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 16 XML, Trees nd Automt Question: Why utomt? Ingredients of XML Conepts from forml lnguges re obviously present round XML: Lbelled trees DTD: ontext-free grmmrs DTD: regulr expressions XPth: regulr pth expressions We will see Automt turn out to be useful s: mens to define robust lsses with ler semntis tool for proofs n lgorithmi tool for stti nlysis tool for query evlution

44 Introdution Contents Bkground on Tree Automt nd Logi Prllel Rnked Tree Automt Sequentil Rnked Tree Automt Deision Problems for Rnked Tree Automt Prllel Unrnked Tree Automt Sequentil Unrnked Tree Automt Sequentil Doument Automt Shem Lnguges XPth nd Node-seleting Queries XSLT XQuery Conlusion

45 From Strings to Trees A String bb Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 18

46 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 18 String s Tree From Strings to Trees A String bb b b

47 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 18 String s Tree b From Strings to Trees A String bb A Rnked Tree b b b b b

48 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 18 String s Tree From Strings to Trees A String bb A Rnked Tree An Unrnked Tree b b e e e e b e e e e b b b e e e

49 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 19 From Strings to Trees (ont.) XML nd Trees XML trees re unrnked : the number of hildren of node is not restrited Automt hve first been onsidered on rnked trees, where eh symbol hs fixed number of hildren (rnk) Most importnt ides were lredy developed for rnked trees Let us tke look t this first

50 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 20 Trees s Terms Remrk Sometimes trees re viewed s terms b Exmple b Exmple Tree s Term 1 (b 2 ( 1 ( 2 (b, )), b 2 ( 2 (b, ), ))) b b

51 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

52 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21

53 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

54 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

55 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

56 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

57 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

58 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

59 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

60 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

61 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

62 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21

63 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

64 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

65 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

66 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

67 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 21 From String Automt to Tree Automt Question How do utomt generlize to trees? Sequentil e Prllel e e e e e e e

68 Bottom-Up Automt Exmple: Tree-strutured Boolen Ciruits Ide Tree-strutured Boolen iruits Two sttes: q 0, q 1 Aepting t the root: q 1 Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {ɛ}; δ(0, q 1 ) = δ(1, q 1 ) = {ɛ}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 22

69 Bottom-Up Automt Exmple: Tree-strutured Boolen Ciruits 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1 Ide Tree-strutured Boolen iruits Two sttes: q 0, q 1 Aepting t the root: q 1 Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {ɛ}; δ(0, q 1 ) = δ(1, q 1 ) = {ɛ}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 22

70 Bottom-Up Automt Exmple: Tree-strutured Boolen Ciruits q 0 q 1 q 1 q 1 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1 Ide Tree-strutured Boolen iruits Two sttes: q 0, q 1 Aepting t the root: q 1 Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {ɛ}; δ(0, q 1 ) = δ(1, q 1 ) = {ɛ}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 22

71 Bottom-Up Automt Exmple: Tree-strutured Boolen Ciruits q 1 q 1 q 0 q 1 q 1 q 1 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1 Ide Tree-strutured Boolen iruits Two sttes: q 0, q 1 Aepting t the root: q 1 Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {ɛ}; δ(0, q 1 ) = δ(1, q 1 ) = {ɛ}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 22

72 Bottom-Up Automt Exmple: Tree-strutured Boolen Ciruits q 1 q 1 q 1 q 0 q 1 q 1 q 1 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1 Ide Tree-strutured Boolen iruits Two sttes: q 0, q 1 Aepting t the root: q 1 Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {ɛ}; δ(0, q 1 ) = δ(1, q 1 ) = {ɛ}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 22

73 Non-det. Top-Down Automt Exmple Ide Guess the orret vlues strting from the root Chek t the leves Three sttes: q 0, q 1, Initil stte q 1 t the root Aepting if ll leves end in Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {}; δ(0, q 1 ) = δ(1, q 1 ) = {}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 23

74 Non-det. Top-Down Automt Exmple q Ide Guess the orret vlues strting from the root Chek t the leves Three sttes: q 0, q 1, Initil stte q 1 t the root Aepting if ll leves end in Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {}; δ(0, q 1 ) = δ(1, q 1 ) = {}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 23

75 Non-det. Top-Down Automt Exmple q 1 q 1 q Ide Guess the orret vlues strting from the root Chek t the leves Three sttes: q 0, q 1, Initil stte q 1 t the root Aepting if ll leves end in Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {}; δ(0, q 1 ) = δ(1, q 1 ) = {}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 23

76 Non-det. Top-Down Automt Exmple q 1 q 1 q 1 q 0 q 1 q 1 q Ide Guess the orret vlues strting from the root Chek t the leves Three sttes: q 0, q 1, Initil stte q 1 t the root Aepting if ll leves end in Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {}; δ(0, q 1 ) = δ(1, q 1 ) = {}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 23

77 Non-det. Top-Down Automt Exmple q 1 q 1 q 1 q 0 q 1 q 1 q 1 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1 Ide Guess the orret vlues strting from the root Chek t the leves Three sttes: q 0, q 1, Initil stte q 1 t the root Aepting if ll leves end in Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {}; δ(0, q 1 ) = δ(1, q 1 ) = {}; δ(1, q 0 ) = Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 23

78 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 23 Non-det. Top-Down Automt Exmple q 1 q 1 q 1 q 0 q 1 q 1 q 1 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1 Ide Guess the orret vlues strting from the root Chek t the leves Three sttes: q 0, q 1, Initil stte q 1 t the root Aepting if ll leves end in Trnsitions δ(, q 1 ) = {(q 1, q 1 )} δ(, q 0 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 0, q 0 )} δ(, q 1 ) = {(q 0, q 1 ), (q 1, q 0 ), (q 1, q 1 )} δ(, q 0 ) = {(q 0, q 0 )} δ(0, q 0 ) = {}; δ(0, q 1 ) = δ(1, q 1 ) = {}; δ(1, q 0 ) =

79 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 24 Regulr Tree Lnguges Definition A bottom-up utomton is deterministi if for eh nd p q: δ(, p) δ(, q) = Theorem The following re equivlent for tree lnguge L: () L is epted by nondeterministi bottom-up utomton (b) L is epted by deterministi bottom-up utomton () L is epted by nondeterministi top-down utomton Proof ide () = (b): Powerset onstrution () (): Just the sme thing, viewed in two different wys

80 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 25 Automt s Tiling Systems Observtion (q 0, q 1 ) δ(, q 1 ) n be interpreted s n llowed pttern:, q 1 q 0 q 1 A tree is epted, iff there is lbelling with sttes suh tht ll lol ptterns re llowed the root is lbelled with q 1

81 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 25 Automt s Tiling Systems Observtion (q 0, q 1 ) δ(, q 1 ) n be interpreted s n llowed pttern:, q 1 q 0 q 1 A tree is epted, iff there is lbelling with sttes suh tht ll lol ptterns re llowed the root is lbelled with q 1 Exmple

82 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 25 Automt s Tiling Systems Observtion (q 0, q 1 ) δ(, q 1 ) n be interpreted s n llowed pttern:, q 1 q 0 q 1 A tree is epted, iff there is lbelling with sttes suh tht ll lol ptterns re llowed the root is lbelled with q 1 Exmple q 1 q 1 q 1 q 0 q 1 q 1 q 1 0 q 0 1 q 1 1 q 1 0 q 0 0 q 0 1 q 1 1 q 1 1 q 1

83 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 26 Formuls tlk bout Regulr tree lnguges nd logi edges of the tree (E) node lbels (Q 0, Q 1, Q, Q ) the root of the tree (root) Definition: (MSO logi) First-order-vribles represent nodes Mondi seond-order (MSO) vribles represent sets of nodes Exmple: Boolen Ciruits Boolen iruit true X X(root) x (Q 0 (x) X(x)) ((Q (x) X(x)) ( y[e(x, y) X(y)])) ((Q (x) X(x)) ( y[e(x, y) X(y)])) Theorem [Doner 70; Thther, Wright 68] MSO Regulr Tree Lnguges

84 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 27 Regulr tree lnguges nd logi (ont.) Theorem MSO Regulr Tree Lnguges Proof ide Automt MSO: Formul expresses tht there exists orret tiling MSO Automt: more involved Bsi ide: Automton omputes for eh node v the set of formuls whih hold in the subtree rooted t v

85 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 28 Regulr tree lnguges nd logi (ont.) Formul utomton Let ϕ be n MSO-formul, k := quntifier-depth of ϕ k-type of tree t := (essentilly) set of MSO-formuls ψ of quntifier-depth k whih hold in t t 1 k t 2 : k-type(t 1 ) = k-type(t 2 ) Automton omputes k-type of tree nd onludes whether ϕ holds Cruil ft l l t 1 k t 1 = t 1 t 2 k t 1 t 2 t 2 k t 2

86 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 29 Det. Top-Down Automt Question Wht is the right notion for deterministi top-down utomt? 3 Possibilities Stte t node v might depend on stte nd symbol of prent q stte nd symbol of prent nd symbol of v v q stte nd symbol of prent nd symbols t v nd its sibling v q v e

87 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 30 Det. Top-Down Automt: Aeptne Question Wht is good eptne mehnism for deterministi top-down utomt? Severl possibilitites (1) At ll leves sttes hve to be epting (2) There is leve with n epting stte (2) is problemti for omplement nd intersetion (1) is problemti for omplement nd union

88 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 31 Det. Top-Down Automt: Aeptne (ont.) Definition: (Root-to-frontier utomt with regulr eptne ondition) Tree utomt A re equipped with n dditionl regulr string lnguge L over Q Σ A epts t if the (stte,symbol)-string t the leves (from left to right) is in L [Jurvnen, Potthoff, Thoms 93] Illustrtion (q 1, 1 ) (q n, n ) A robust lss The resulting lss is losed under Boolen opertions Good lgorithmi properties Does not pture ll regulr tree lnguges

89 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 32 Summry Regulr tree lnguges Regulr tree lnguges re robust lss Chrterized by prllel tree utomt MSO logi severl other models They re the nturl nlog of regulr string lnguges Deterministi top-down utomt with regulr eptne onditions define weker but nevertheless robust lss

90 Introdution Contents Bkground on Tree Automt nd Logi Prllel Rnked Tree Automt Sequentil Rnked Tree Automt Deision Problems for Rnked Tree Automt Prllel Unrnked Tree Automt Sequentil Unrnked Tree Automt Sequentil Doument Automt Shem Lnguges XPth nd Node-seleting Queries XSLT XQuery Conlusion

91 Tree-Wlk Automt Definition: (Tree-wlk utomt) Depending on urrent stte symbol of urrent node r TWA T e position of urrent node wrt its siblings e A u t the utomton moves to neighbor nd tkes new stte o s Question Wht is the expressive power of tree-wlk utomt? Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 34

92 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple Ide q q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

93 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

94 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

95 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

96 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

97 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

98 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

99 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

100 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

101 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

102 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

103 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

104 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

105 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

106 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

107 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

108 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

109 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

110 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

111 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

112 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

113 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

114 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

115 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

116 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

117 Tree-Wlk Automt (ont.) Ft Tree-wlk utomt n evlute Boolen iruit trees 5 sttes Exmple q 1 0 Ide q 0 1 q Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 35

118 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 36 A Reent Result nd n Even More Reent Result Theorem [Bojnzyk, Colombet 04] Deterministi TWAs re weker thn nondeterministi TWAs Corollry Deterministi TWAs do not pture ll regulr tree lnguges Theorem [Bojnzyk, Colombet 04] Nondeterministi TWAs do not pture ll regulr tree lnguges

119 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 37 Overview of Models Non-det. top-down tree utomt Non-det. bottom-up tree utomt Det. bottom-up tree utomt Non-det. tree wlk utomt Det. top-down tree utomt Det. tree wlk utomt

120 Introdution Contents Bkground on Tree Automt nd Logi Prllel Rnked Tree Automt Sequentil Rnked Tree Automt Deision Problems for Rnked Tree Automt Prllel Unrnked Tree Automt Sequentil Unrnked Tree Automt Sequentil Doument Automt Shem Lnguges XPth nd Node-seleting Queries XSLT XQuery Conlusion

121 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 39 Given: Deision Problems Algorithmi problems We onsider the following lgorithmi problems All of them will be useful in the XML ontext Membership test for A Question: Tree t Is t L(A)? Given: Given: Membership test (ombined) Question: Non-emptiness Automton A Question: Is L(A)? Automton A, tree t Is t L(A)? Continment Given: Automt A 1, A 2 Question: Is L(A 1 ) L(A 2 )? Equivlene Given: Automt A 1, A 2 Question: Is L(A 1 ) = L(A 2 )?

122 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 40 Membership Test Fts Time Bounds for the ombined omplexity of membership test for tree utomt: Deterministi (prllel) tree utomt: O( A t ) Nondeterministi (prllel) tree utomt: O( A 2 t ) (Compute, for eh node, the set of rehble sttes) Deterministi TWAs: O( A 2 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior funtion ) Nondeterministi TWAs: O( A 3 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior reltion )

123 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 40 Membership Test Fts Time Bounds for the ombined omplexity of membership test for tree utomt: Deterministi (prllel) tree utomt: O( A t ) Nondeterministi (prllel) tree utomt: O( A 2 t ) (Compute, for eh node, the set of rehble sttes) Deterministi TWAs: O( A 2 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior funtion ) Nondeterministi TWAs: O( A 3 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior reltion )

124 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 40 Membership Test Fts Time Bounds for the ombined omplexity of membership test for tree utomt: Deterministi (prllel) tree utomt: O( A t ) Nondeterministi (prllel) tree utomt: O( A 2 t ) (Compute, for eh node, the set of rehble sttes) Deterministi TWAs: O( A 2 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior funtion ) Nondeterministi TWAs: O( A 3 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior reltion )

125 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 40 Membership Test Fts Time Bounds for the ombined omplexity of membership test for tree utomt: Deterministi (prllel) tree utomt: O( A t ) Behvior Funtion Nondeterministi (prllel) tree utomt: O( A 2 t ) v (Compute, for eh node, the set of rehble sttes) f : Q Q Deterministi TWAs: O( A 2 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior funtion ) Nondeterministi TWAs: O( A 3 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior reltion )

126 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 40 Membership Test Fts Time Bounds for the ombined omplexity of membership test for tree utomt: Deterministi (prllel) tree utomt: O( A t ) Nondeterministi (prllel) tree utomt: O( A 2 t ) (Compute, for eh node, the set of rehble sttes) Deterministi TWAs: O( A 2 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior funtion ) Nondeterministi TWAs: O( A 3 t ) (Compute, for eh node v, the ggregted behvior of A on its subtree: Behvior reltion )

127 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 41 Membership Test (ont.) Question: Wht is the struturl omplexity for the vrious models? [Lohrey 01, Segoufin 03] Model Time Complexity Struturl Complexity Det. top-down TA O( A t ) LOGSPACE Det. bottom-up TA O( A t ) LOGDCFL Nondet. bottom-up TA O( A 2 t ) LOGCFL Nondet. top-down TA O( A 2 t ) LOGCFL Det. TWA O( A 2 t ) LOGSPACE Nondet. TWA O( A 3 t ) NLOGSPACE

128 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 42 Non-emptiness Fts Non-emptiness for string utomt orresponds to Grph Rehbility (omplete for NLOGSPACE) Non-emptiness for tree utomt : orresponds to Pth Systems p 1 p 2 q

129 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 42 Non-emptiness Fts Non-emptiness for string utomt orresponds to Grph Rehbility (omplete for NLOGSPACE) Non-emptiness for tree utomt : orresponds to Pth Systems p 1 p 2 q

130 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 42 Non-emptiness Fts Non-emptiness for string utomt orresponds to Grph Rehbility (omplete for NLOGSPACE) Non-emptiness for tree utomt : orresponds to Pth Systems p 1 p 2 q

131 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 42 Non-emptiness Fts Non-emptiness for string utomt orresponds to Grph Rehbility (omplete for NLOGSPACE) Non-emptiness for tree utomt : orresponds to Pth Systems p 1 p 2 q

132 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 42 Non-emptiness Fts Non-emptiness for string utomt orresponds to Grph Rehbility (omplete for NLOGSPACE) Non-emptiness for tree utomt : orresponds to Pth Systems p 1 p 2 q Result Non-emptiness for bottom-up tree utomt n be heked in liner time It is omplete for PTIME

133 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 43 Continment/Equivlene Of ourse: Observtions L(A 1 ) = L(A 2 ) [L(A 1 ) L(A 2 ) nd L(A 2 ) L(A 1 )] Complexity of ontinment problem is very different for deterministi nd non-deterministi utomt Deterministi utomt: onstrut produt utomton

134 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e f b

135 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e 1 f 0 0 b

136 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d 1 e 1 f 0 0 b

137 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d e 0 1 f 0 0 b

138 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e 1 f 0 0 b

139 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d 1 e 1 f 0 0 b

140 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d e 0 1 f 0 0 b

141 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e 1 f 0 0 b

142 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e 1 f 0 0 b

143 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e f b d e f b 0 bd 1 be 0 bf

144 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e f b d e f b 0 bd 1 be 0 bf

145 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d 1 e 0 f b d e f b 0 bd 1 be 0 bf

146 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d 1 e 0 f b d e f b 0 bd 1 be 0 bf

147 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e f b d e f b 0 bd 1 be 0 bf

148 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d 1 e 0 f b d e f b 0 bd 1 be 0 bf

149 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring ,1 0 d 1 e 0 f b d e f b 0 bd 1 be 0 bf

150 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e f b d e f b 0 bd 1 be 0 bf

151 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 44 Reminder: Produt utomton Produt of 2 string utomt even number of zeros ontins substring , d e f b d e f b 0 bd 1 be 0 bf

152 Continment: Complexity Deterministi bottom-up tree utomt Produt utomton nlogous s for string utomt Set of sttes: Q 1 Q 2 Trnsitions omponent-wise To hek L(A 1 ) L(A 2 ): Compute B = A 1 A 2 Aepting sttes: F 1 (Q 2 F 2 ) Chek whether L(B) = If so, L(A 1 ) L(A 2 ) holds Theorem Complexity of Continment for deterministi bottom-up tree utomt: O( A 1 A 2 ) Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 45

153 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 46 Continment: Complexity (ont.) Non-deterministi utomt Nive pproh: Mke A 2 deterministi (size: O(2 A 2 )) Construt produt utomton Exponentil time

154 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 46 Continment: Complexity (ont.) Non-deterministi utomt Nive pproh: Mke A 2 deterministi (size: O(2 A 2 )) Construt produt utomton Exponentil time Unfortuntely... There is essentilly no better wy

155 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 46 Continment: Complexity (ont.) Non-deterministi utomt Nive pproh: Mke A 2 deterministi (size: O(2 A 2 )) Construt produt utomton Exponentil time Unfortuntely... There is essentilly no better wy Theorem [Seidl 1990] Continment for non-deterministi tree utomt is omplete for EXPTIME

156 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 47 Det. Top-Down Automt: Non-Emptiness Theorem Nonemptiness for deterministi top-down utomt A n be heked in polynomil time Proof ide Chek for eh stte p of A nd eh pir (q, q ) of the leves utomton B: Is there tree t suh tht A strts from stte p nd obtins leve string whih brings B from q to q? Illustrtion p q q

157 Shwentik XML: Algorithms & Complexity Introdution - XML Proessing 48 Det. Top-Down Automt: Continment Theorem Continment for deterministi top-down utomt A n be heked in polynomil time Proof ide Tree utomt A 1, A 2 with leves utomt B 1, B 2 Chek for eh pir (p 1, p 2 ) of sttes of A 1 nd A 2 nd for eh two pirs (q 1, q 1 ) nd (q 2, q 2 ) of B 1 nd B 2, resp.: Is there tree t suh tht for both i = 1, i = 2: T i strts from stte p i nd obtins leve string whih brings B i from q i to q i?