The following pages link to Thomas Place (Q782558):
Displayed 33 items.
- Deciding classes of regular languages: the covering approach (Q782559) (← links)
- Characterizing level one in group-based concatenation hierarchies (Q2097235) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- Separating Regular Languages with First-Order Logic (Q2794672) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- Separating Regular Languages by Piecewise Testable and Unambiguous Languages (Q2849957) (← links)
- On Separation by Locally Testable and Locally Threshold Testable Languages (Q2921121) (← links)
- (Q2955031) (← links)
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages (Q2963927) (← links)
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003) (← links)
- Toward Model Theory with Data Values (Q3167004) (← links)
- Deciding definability in FO2(<h,<v) on trees (Q3196335) (← links)
- A decidable characterization of locally testable tree languages (Q3224693) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- Frame Definability for Classes of Trees in the μ-calculus (Q3586099) (← links)
- A Decidable Characterization of Locally Testable Tree Languages (Q3638101) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- (Q4580330) (← links)
- (Q4608640) (← links)
- Separating regular languages with first-order logic (Q4635660) (← links)
- Separating Regular Languages with Two Quantifiers Alternations (Q4635804) (← links)
- Adding Successor (Q4972173) (← links)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- The Complexity of Separation for Levels in Concatenation Hierarchies (Q5090988) (← links)
- On All Things Star-Free (Q5092328) (← links)
- (Q5144616) (← links)
- (Q5155687) (← links)
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (Q5167850) (← links)
- (Q5232909) (← links)
- Going Higher in First-Order Quantifier Alternation Hierarchies on Words (Q5244385) (← links)
- (Q5376662) (← links)
- How many times do you need to go back to the future in unary temporal logic? (Q6109021) (← links)