Pages that link to "Item:Q2794672"
From MaRDI portal
The following pages link to Separating regular languages with first-order logic (Q2794672):
Displaying 26 items.
- Minimal consistent DFA revisited (Q306711) (← links)
- Pointlike sets and separation: a personal perspective (Q832918) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Measuring power of locally testable languages (Q2164008) (← links)
- Recognizing pro-\(\mathrm{R}\) closures of regular languages (Q2171905) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Reducibility of pointlike problems (Q2362748) (← links)
- Pointlike sets for varieties determined by groups (Q2631933) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- Separation and the successor relation (Q2955031) (← links)
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages (Q2963927) (← links)
- Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes (Q3121327) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- (Q4580330) (← links)
- Separating regular languages with first-order logic (Q4635660) (← links)
- A Survey on Difference Hierarchies of Regular Languages (Q4637687) (← links)
- AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES (Q4658712) (← links)
- (Q4968382) (← links)
- (Q5009453) (← links)
- RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES (Q5015731) (← links)
- The Complexity of Separation for Levels in Concatenation Hierarchies (Q5090988) (← links)
- On All Things Star-Free (Q5092328) (← links)
- Separating the Words of a Language by Counting Factors (Q5158654) (← links)
- (Q5376662) (← links)
