Pages that link to "Item:Q5311161"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311161):
Displayed 8 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)