Pages that link to "Item:Q649107"
From MaRDI portal
The following pages link to Regular languages of nested words: fixed points, automata, and synchronization (Q649107):
Displaying 4 items.
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)