Thomas Place

74 papers A* 10A 1B 7C 3Misc 2Journal 41Unranked 9
YearRankTypeTitle / Venue / Authors
2025 C conf
A First Taste of MeSCaL, a Tool for Solving Membership Problems for Regular Languages.
CIAA
Thomas Place, Marc Zeitoun
2025 J jnl
Closing Star-Free Closure.
ACM Trans. Comput. Log.
Thomas Place, Marc Zeitoun
2025 C conf
In Orbit with MeSCaL: Higher in Concatenation and Navigational Hierarchies of Regular Languages.
CIAA
Thomas Place, Marc Zeitoun
2025 A* conf
Navigational hierarchies of regular languages.
LICS
Thomas Place, Marc Zeitoun
2024 B conf
A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic.
CSL
Thomas Place, Marc Zeitoun
2024 A* conf
Dot-depth three, return of the J-class.
LICS
Thomas Place, Marc Zeitoun
2024 J jnl
Dot-depth three, return of the J-class.
CoRR
Thomas Place, Marc Zeitoun
2024 J jnl
Temporal hierarchies of regular languages.
CoRR
Thomas Place, Marc Zeitoun
2023 J jnl
A generic characterization of generalized unary temporal logic and two-variable first-order logic.
CoRR
Thomas Place, Marc Zeitoun
2023 J jnl
All about unambiguous polynomial closure.
TheoretiCS
Thomas Place, Marc Zeitoun
2023 J jnl
Closing star-free closure.
CoRR
Thomas Place, Marc Zeitoun
2023 A* conf
Group Separation Strikes Back.
LICS
Thomas Place, Marc Zeitoun
2022 — conf
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation.
FSTTCS
Thomas Place, Marc Zeitoun
2022 J jnl
A generic polynomial time approach to separation by first-order logic without quantifier alternation.
CoRR
Thomas Place, Marc Zeitoun
2022 Misc conf
Characterizing Level One in Group-Based Concatenation Hierarchies.
CSR
Thomas Place, Marc Zeitoun
2022 J jnl
Characterizing level one in group-based concatenation hierarchies.
CoRR
Thomas Place, Marc Zeitoun
2022 J jnl
Group separation strikes back.
CoRR
Thomas Place, Marc Zeitoun
2022 B conf
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?
LATIN
Thomas Place, Marc Zeitoun
2022 A* conf
The amazing mixed polynomial closure and its applications to two-variable first-order logic.
LICS
Thomas Place
2022 J jnl
The amazing mixed polynomial closure and its applications to two-variable first-order logic.
CoRR
Thomas Place
2022 J jnl
Unambiguous polynomial closure explained.
CoRR
Thomas Place, Marc Zeitoun
2021 J jnl
Separation for dot-depth two.
Log. Methods Comput. Sci.
Thomas Place, Marc Zeitoun
2020 J jnl
Adding Successor: A Transfer Theorem for Separation and Covering.
ACM Trans. Comput. Log.
Thomas Place, Marc Zeitoun
2020 C conf
Deciding Classes of Regular Languages: The Covering Approach.
LATA
Thomas Place
2019 J jnl
Covering and separation for logical fragments with modular predicates.
Log. Methods Comput. Sci.
Thomas Place, Varun Ramanathan, Pascal Weil
2019 J jnl
Generic Results for Concatenation Hierarchies.
Theory Comput. Syst.
Thomas Place, Marc Zeitoun
2019 J jnl
Going Higher in First-Order Quantifier Alternation Hierarchies on Words.
J. ACM
Thomas Place, Marc Zeitoun
2019 A* conf
On All Things Star-Free.
ICALP
Thomas Place, Marc Zeitoun
2019 J jnl
On all things star-free.
CoRR
Thomas Place, Marc Zeitoun
2019 J jnl
Regular tree languages in low levels of the Wadge Hierarchy.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
2019 A* conf
Separation and covering for group based concatenation hierarchies.
LICS
Thomas Place, Marc Zeitoun
2019 J jnl
Separation and covering for group based concatenation hierarchies.
CoRR
Thomas Place, Marc Zeitoun
2019 J jnl
Separation for dot-depth two.
CoRR
Thomas Place, Marc Zeitoun
2018 J jnl
A generic characterization of Pol(C).
CoRR
Thomas Place, Marc Zeitoun
2018 J jnl
Covering and separation for logical fragments with modular predicates.
CoRR
Thomas Place, Varun Ramanathan, Pascal Weil
2018 J jnl
Regular tree languages in low levels of Wadge Hierarchy.
CoRR
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
2018 A* conf
Separating Without Any Ambiguity.
ICALP
Thomas Place, Marc Zeitoun
2018 J jnl
Separating regular languages with two quantifier alternations.
Log. Methods Comput. Sci.
Thomas Place
2018 — conf
The Complexity of Separation for Levels in Concatenation Hierarchies.
FSTTCS
Thomas Place, Marc Zeitoun
2018 J jnl
The Covering Problem.
Log. Methods Comput. Sci.
Thomas Place, Marc Zeitoun
2018 J jnl
The complexity of separation for levels in concatenation hierarchies.
CoRR
Thomas Place, Marc Zeitoun
2017 J jnl
Adding successor: A transfer theorem for separation and covering.
CoRR
Thomas Place, Marc Zeitoun
2017 Misc conf
Concatenation Hierarchies: New Bottle, Old Wine.
CSR
Thomas Place, Marc Zeitoun
2017 J jnl
Generic Results for Concatenation Hierarchies.
CoRR
Thomas Place, Marc Zeitoun
2017 J jnl
Going Higher in First-Order Quantifier Alternation Hierarchies on Words.
CoRR
Thomas Place, Marc Zeitoun
2017 J jnl
Separating regular languages with two quantifier alternations.
CoRR
Thomas Place
2017 A* conf
Separation for dot-depth two.
LICS
Thomas Place, Marc Zeitoun
2017 J jnl
The Covering Problem.
CoRR
Thomas Place, Marc Zeitoun
2016 J jnl
Decidable Characterization of FO2(<, +1) and locality of DA.
CoRR
Thomas Place, Luc Segoufin
2016 B conf
Quantifier Alternation for Infinite Words.
FoSSaCS
Théo Pierron, Thomas Place, Marc Zeitoun
2016 J jnl
Separating Regular Languages with First-Order Logic.
Log. Methods Comput. Sci.
Thomas Place, Marc Zeitoun
2016 B conf
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics.
MFCS
Thomas Place, Marc Zeitoun
2015 J jnl
A Transfer Theorem for the Separation Problem.
CoRR
Thomas Place, Marc Zeitoun
2015 J jnl
Deciding definability in FO2(<h, <v) on trees.
Log. Methods Comput. Sci.
Thomas Place, Luc Segoufin
2015 J jnl
Quantifier Alternation for Infinite Words.
CoRR
Théo Pierron, Thomas Place, Marc Zeitoun
2015 A* conf
Separating Regular Languages with Two Quantifiers Alternations.
LICS
Thomas Place
2015 A conf
Separation and the Successor Relation.
STACS
Thomas Place, Marc Zeitoun
2015 J jnl
The tale of the quantifier alternation hierarchy of first-order logic over words.
ACM SIGLOG News
Thomas Place, Marc Zeitoun
2014 — conf
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words.
ICALP (2)
Thomas Place, Marc Zeitoun
2014 J jnl
Going higher in the First-order Quantifier Alternation Hierarchy on Words.
CoRR
Thomas Place, Marc Zeitoun
2014 J jnl
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.
Log. Methods Comput. Sci.
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
2014 — conf
Separating regular languages with first-order logic.
CSL-LICS
Thomas Place, Marc Zeitoun
2013 — conf
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.
FSTTCS
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
2013 B conf
Separating Regular Languages by Piecewise Testable and Unambiguous Languages.
MFCS
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
2013 J jnl
Separating regular languages by piecewise testable and unambiguous languages
CoRR
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
2012 — conf
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets.
ICALP (2)
Mikolaj Bojanczyk, Thomas Place
2012 — conf
Toward Model Theory with Data Values.
ICALP (2)
Mikolaj Bojanczyk, Thomas Place
2011 J jnl
A decidable characterization of locally testable tree languages
Log. Methods Comput. Sci.
Thomas Place, Luc Segoufin
2010 — —
Decidable characterizations for tree logics. (Caractérisation décidables de logiques sur les arbres).
Thomas Place
2010 A* conf
Deciding Definability in FO
LICS
Thomas Place, Luc Segoufin
2010 B conf
Frame Definability for Classes of Trees in the
MFCS
Gaëlle Fontaine, Thomas Place
2009 — conf
A Decidable Characterization of Locally Testable Tree Languages.
ICALP (2)
Thomas Place, Luc Segoufin
2008 B conf
Characterization of Logics over Ranked Tree Languages.
CSL
Thomas Place
2000 — conf
Decomate: Unified Access to Globally Distributed Libraries.
ECDL
Thomas Place, Jeroen Hoppenbrouwers