Efficient inclusion checking for deterministic tree automata and XML Schemas

We present algorithms for testing language inclusion L(A)@?L(B) between tree automata in time O(|A|.|B|) where B is deterministic (bottom-up or top-down). We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with restrained competition D in time O(|A|.|@S|.|D|). Previous algorithms were less efficient or less general.

[1]  Joachim Niehren,et al.  Efficient Inclusion Checking for Deterministic Tree Automata and DTDs , 2008, LATA.

[2]  Helmut Seidl.  Deciding Equivalence of Finite Tree Automata , 1990, SIAM J. Comput..

[3]  Eric van der Vlist,et al.  Relax NG , 2003 .

[4]  Letizia Tanca,et al.  What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..

[5]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[6]  Anne Brüggemann-Klein.  Regular Expressions into Finite Automata , 1993, Theor. Comput. Sci..

[7]  Derick Wood,et al.  One-Unambiguous Regular Languages , 1998, Inf. Comput..

[8]  Helmut Seidl,et al.  Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[9]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[10]  Thomas Schwentick,et al.  Expressiveness and complexity of XML Schema , 2006, TODS.

[11]  Helmut Seidl,et al.  Locating Matches of Tree Patterns in Forests , 1998, FSTTCS.

[12]  Joachim Niehren,et al.  On the minimization of XML Schemas and tree automata for unranked trees , 2007, J. Comput. Syst. Sci..

[13]  Georg Gottlob,et al.  Monadic queries over tree-structured data , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[14]  J. Virágh,et al.  Deterministic ascending tree automata I , 1980, Acta Cybern..

[15]  J. Virágh.  Deterministic ascending tree automata II , 1983, Acta Cybern..

[16]  Rajeev Alur.  Marrying Words and Trees , 2007, CSR.

[17]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[18]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, PODS '00.

[19]  Djelloul Ziadi,et al.  From regular expressions to finite automata , 1999, Int. J. Comput. Math..

[20]  Derick Wood,et al.  Regular tree and regular hedge languages over unranked alphabets , 2001 .

[21]  EiterThomas,et al.  Complexity and expressive power of logic programming , 2001 .

[22]  Michel Minoux,et al.  LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation , 1988, Inf. Process. Lett..

[23]  Joachim Niehren,et al.  Streaming tree automata , 2008, Inf. Process. Lett..

[24]  Joachim Niehren,et al.  Schema-Guided Induction of Monadic Queries , 2008, ICGI.

[25]  Thomas Schwentick,et al.  Automata for XML - A survey , 2007, J. Comput. Syst. Sci..

[26]  Murali Mani,et al.  Taxonomy of XML schema languages using formal language theory , 2005, TOIT.

[27]  Eric van der Vlist,et al.  XML Schema , 2002 .

[28]  Frank Neven,et al.  DTDs versus XML schema: a practical study , 2004, WebDB '04.

[29]  Thomas Schwentick,et al.  Which XML Schemas Admit 1-Pass Preorder Typing? , 2005, ICDT.

[30]  Helmut Seidl,et al.  XML type checking with macro tree transducers , 2005, PODS '05.

[31]  Joachim Niehren,et al.  Querying Unranked Trees with Stepwise Tree Automata , 2004, RTA.

[32]  M Bruynooghe,et al.  Information Extraction from Web Pages Based on Tree Automata Induction , 2022 .

[33]  Masami Hagiya,et al.  XML Schema Containment Checking Based on Semi-implicit Techniques , 2003, CIAA.

[34]  Thomas Schwentick,et al.  Complexity of Decision Problems for Simple Regular Expressions , 2004, MFCS.

[35]  Denis Lugiez,et al.  XML schema, tree logic and sheaves automata , 2003, Applicable Algebra in Engineering, Communication and Computing.

[36]  Stefan Raeymaekers.  Information Extraction from Web Pages based on Tree Automata Induction (Informatie extractie uit web-pagina's door middel van inductie van boomautomaten) , 2008 .

[37]  Georg Gottlob,et al.  Datalog LITE: a deductive query language with linear time model checking , 2002, TOCL.