Author of the publication

On the Topological Complexity of Weakly Recognizable Tree Languages.

, and . FCT, volume 4639 of Lecture Notes in Computer Science, page 261-273. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Index problems for game automata., , and . CoRR, (2015)Monadic Datalog and Regular Tree Pattern Queries., , and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 426-437. Springer, (2014)Containment of Monadic Datalog Programs via Bounded Clique-Width., , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 427-439. Springer, (2015)Containment of Graph Queries Modulo Schema., , , and . Proc. ACM Manag. Data, 2 (2): 77 (2024)Evaluating Graph Queries Using Semantic Treewidth., , and . ICDT, volume 290 of LIPIcs, page 22:1-22:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Reasoning about integrity constraints for tree-structured data., , , and . Theory Comput. Syst., 62 (4): 941-976 (2018)Answering regular path queries mediated by unrestricted SQ ontologies., , , and . Artif. Intell., (2023)Finite Query Answering in Expressive Description Logics with Transitive Roles., , and . KR, page 369-378. AAAI Press, (2018)On the Topological Complexity of Weakly Recognizable Tree Languages., and . FCT, volume 4639 of Lecture Notes in Computer Science, page 261-273. Springer, (2007)On Deciding Topological Classes of Deterministic Tree Languages.. CSL, volume 3634 of Lecture Notes in Computer Science, page 428-441. Springer, (2005)