The following pages link to (Q4474840):
Displaying 27 items.
- Aural pattern recognition experiments and the subregular hierarchy (Q438585) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- A descriptive characterisation of linear languages (Q851197) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Logic for \(\omega\)-pushdown automata (Q2064532) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- The dark side of interval temporal logic: marking the undecidability border (Q2251125) (← links)
- Weighted automata with storage (Q2280328) (← links)
- First-Order Logic Definability of Free Languages (Q3194725) (← links)
- (Q3384888) (← links)
- (Q3386623) (← links)
- Weighted Logics for Nested Words and Algebraic Formal Power Series (Q3519504) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Monadic Second-Order Logic and Transitive Closure Logics over Trees (Q4917997) (← links)
- (Q4964729) (← links)
- (Q5028456) (← links)
- (Q5101344) (← links)
- Weighted Operator Precedence Languages (Q5111245) (← links)
- Locally finite languages (Q5941071) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- Enumerating grammar-based extractions (Q6069180) (← links)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages (Q6137830) (← links)
- Bounded fixed-point definability and tabular recognition of languages (Q6560180) (← links)
