Thomas Place

Available identifiers

zbMath Open place.thomasMaRDI QIDQ782558

List of research outcomes

Publication	Date of Publication	Type
How many times do you need to go back to the future in unary temporal logic?	2023-07-26	Paper
Characterizing level one in group-based concatenation hierarchies	2022-11-11	Paper
The Complexity of Separation for Levels in Concatenation Hierarchies	2022-07-21	Paper
On All Things Star-Free	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5155687	2021-10-08	Paper
Separating Without Any Ambiguity.	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q5144616	2021-01-19	Paper
Deciding classes of regular languages: the covering approach	2020-07-27	Paper
Adding Successor	2019-11-22	Paper
Going Higher in First-Order Quantifier Alternation Hierarchies on Words	2019-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q5232909	2019-09-13	Paper
Generic results for concatenation hierarchies	2019-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q5376662	2019-05-17	Paper
Separating regular languages with two quantifier alternations	2018-11-30	Paper
https://portal.mardi4nfdi.de/entity/Q4580330	2018-08-15	Paper
Separating regular languages with first-order logic	2018-04-23	Paper
Separating Regular Languages with Two Quantifiers Alternations	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4608640	2018-03-21	Paper
Concatenation hierarchies: new bottle, old wine	2017-08-22	Paper
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages	2017-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q2955031	2017-01-24	Paper
Quantifier Alternation for Infinite Words	2016-06-10	Paper
Separating Regular Languages with First-Order Logic	2016-03-11	Paper
Deciding definability in FO2(<h,<v) on trees	2015-10-29	Paper
On Separation by Locally Testable and Locally Threshold Testable Languages	2014-09-30	Paper
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words	2014-07-01	Paper
Separating Regular Languages by Piecewise Testable and Unambiguous Languages	2013-09-20	Paper
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets	2012-11-01	Paper
Toward Model Theory with Data Values	2012-11-01	Paper
A decidable characterization of locally testable tree languages	2012-04-02	Paper
Frame Definability for Classes of Trees in the μ-calculus	2010-09-03	Paper
A Decidable Characterization of Locally Testable Tree Languages	2009-07-14	Paper
Characterization of Logics over Ranked Tree Languages	2008-11-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Thomas Place