Thomas Place

According to our database, Thomas Place authored at least 46 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Temporal hierarchies of regular languages.

Thomas Place, Marc Zeitoun

CoRR, 2024

Dot-depth three, return of the J-class.

Thomas Place, Marc Zeitoun

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic.

Thomas Place, Marc Zeitoun

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

All about unambiguous polynomial closure.

Thomas Place, Marc Zeitoun

TheoretiCS, 2023

Closing star-free closure.

Thomas Place, Marc Zeitoun

CoRR, 2023

Group Separation Strikes Back.

Thomas Place, Marc Zeitoun

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Unambiguous polynomial closure explained.

Thomas Place, Marc Zeitoun

CoRR, 2022

The amazing mixed polynomial closure and its applications to two-variable first-order logic.

Thomas Place

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?

Thomas Place, Marc Zeitoun

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation.

Thomas Place, Marc Zeitoun

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Characterizing Level One in Group-Based Concatenation Hierarchies.

Thomas Place, Marc Zeitoun

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Separation for dot-depth two.

Thomas Place, Marc Zeitoun

Log. Methods Comput. Sci., 2021

2020

Adding Successor: A Transfer Theorem for Separation and Covering.

Thomas Place, Marc Zeitoun

ACM Trans. Comput. Log., 2020

Deciding Classes of Regular Languages: The Covering Approach.

Thomas Place

Proceedings of the Language and Automata Theory and Applications, 2020

2019

Generic Results for Concatenation Hierarchies.

Thomas Place, Marc Zeitoun

Theory Comput. Syst., 2019

Covering and separation for logical fragments with modular predicates.

Thomas Place, Varun Ramanathan, Pascal Weil

Log. Methods Comput. Sci., 2019

Regular tree languages in low levels of the Wadge Hierarchy.

Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak

Log. Methods Comput. Sci., 2019

Going Higher in First-Order Quantifier Alternation Hierarchies on Words.

Thomas Place, Marc Zeitoun

J. ACM, 2019

Separation and covering for group based concatenation hierarchies.

Thomas Place, Marc Zeitoun

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

On All Things Star-Free.

Thomas Place, Marc Zeitoun

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

The Covering Problem.

Thomas Place, Marc Zeitoun

Log. Methods Comput. Sci., 2018

Separating regular languages with two quantifier alternations.

Thomas Place

Log. Methods Comput. Sci., 2018

A generic characterization of Pol(C).

Thomas Place, Marc Zeitoun

CoRR, 2018

Separating Without Any Ambiguity.

Thomas Place, Marc Zeitoun

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Complexity of Separation for Levels in Concatenation Hierarchies.

Thomas Place, Marc Zeitoun

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Concatenation Hierarchies: New Bottle, Old Wine.

Thomas Place, Marc Zeitoun

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Separating Regular Languages with First-Order Logic.

Thomas Place, Marc Zeitoun

Log. Methods Comput. Sci., 2016

Decidable Characterization of FO2(<, +1) and locality of DA.

Thomas Place, Luc Segoufin

CoRR, 2016

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics.

Thomas Place, Marc Zeitoun

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Quantifier Alternation for Infinite Words.

Théo Pierron, Thomas Place, Marc Zeitoun

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

The tale of the quantifier alternation hierarchy of first-order logic over words.

Thomas Place, Marc Zeitoun

ACM SIGLOG News, 2015

A Transfer Theorem for the Separation Problem.

Thomas Place, Marc Zeitoun

CoRR, 2015

Deciding definability in FO2(<h, <v) on trees.

Thomas Place, Luc Segoufin

Log. Methods Comput. Sci., 2015

Separation and the Successor Relation.

Thomas Place, Marc Zeitoun

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Separating Regular Languages with Two Quantifiers Alternations.

Thomas Place

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.

Thomas Place, Lorijn van Rooijen, Marc Zeitoun

Log. Methods Comput. Sci., 2014

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words.

Thomas Place, Marc Zeitoun

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Separating Regular Languages by Piecewise Testable and Unambiguous Languages.

Thomas Place, Lorijn van Rooijen, Marc Zeitoun

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Toward Model Theory with Data Values.

Mikolaj Bojanczyk, Thomas Place

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets.

Mikolaj Bojanczyk, Thomas Place

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

A decidable characterization of locally testable tree languages

Thomas Place, Luc Segoufin

Log. Methods Comput. Sci., 2011

2010

Decidable characterizations for tree logics. (Caractérisation décidables de logiques sur les arbres).

Thomas Place

PhD thesis, 2010

Frame Definability for Classes of Trees in the <i>µ</i>-calculus.

Gaëlle Fontaine, Thomas Place

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Deciding Definability in FO₂(<) (or XPath) on Trees.

Thomas Place, Luc Segoufin

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2008

Characterization of Logics over Ranked Tree Languages.

Thomas Place

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2000

Decomate: Unified Access to Globally Distributed Libraries.

Thomas Place, Jeroen Hoppenbrouwers

Proceedings of the Research and Advanced Technology for Digital Libraries, 2000