Thomas Place

From MaRDI portal
Person:782558

Available identifiers

zbMath Open place.thomasMaRDI QIDQ782558

List of research outcomes





PublicationDate of PublicationType
Separation and covering for group based concatenation hierarchies2024-12-19Paper
The amazing mixed polynomial closure and its applications to two-variable first-order logic2024-12-06Paper
A generic polynomial time approach to separation by first-order logic without quantifier alternation2024-09-12Paper
All about unambiguous polynomial closure2024-07-03Paper
How many times do you need to go back to the future in unary temporal logic?2023-07-26Paper
Characterizing level one in group-based concatenation hierarchies2022-11-11Paper
The Complexity of Separation for Levels in Concatenation Hierarchies2022-07-21Paper
On All Things Star-Free2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q51556872021-10-08Paper
Separating Without Any Ambiguity.2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q51446162021-01-19Paper
Deciding classes of regular languages: the covering approach2020-07-27Paper
Adding Successor2019-11-22Paper
Going Higher in First-Order Quantifier Alternation Hierarchies on Words2019-11-21Paper
https://portal.mardi4nfdi.de/entity/Q52329092019-09-13Paper
Generic results for concatenation hierarchies2019-07-04Paper
https://portal.mardi4nfdi.de/entity/Q53766622019-05-17Paper
Separating regular languages with two quantifier alternations2018-11-30Paper
https://portal.mardi4nfdi.de/entity/Q45803302018-08-15Paper
Separating regular languages with first-order logic2018-04-23Paper
Separating Regular Languages with Two Quantifiers Alternations2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46086402018-03-21Paper
Concatenation hierarchies: new bottle, old wine2017-08-22Paper
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages2017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29550312017-01-24Paper
Quantifier Alternation for Infinite Words2016-06-10Paper
Separating regular languages with first-order logic2016-03-11Paper
Deciding definability in FO2(<h,<v) on trees2015-10-29Paper
On separation by locally testable and locally threshold testable languages2014-09-30Paper
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words2014-07-01Paper
Separating Regular Languages by Piecewise Testable and Unambiguous Languages2013-09-20Paper
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets2012-11-01Paper
Toward Model Theory with Data Values2012-11-01Paper
A decidable characterization of locally testable tree languages2012-04-02Paper
Frame Definability for Classes of Trees in the μ-calculus2010-09-03Paper
A Decidable Characterization of Locally Testable Tree Languages2009-07-14Paper
Characterization of Logics over Ranked Tree Languages2008-11-20Paper

Research outcomes over time

This page was built for person: Thomas Place