Pages that link to "Item:Q1959427"

The following pages link to On pebble automata for data languages with decidable emptiness problem (Q1959427):

Displaying 5 items.

• On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
• Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
• Reachability in pushdown register automata (Q2396722) (← links)
• A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
• Complexity Hierarchies beyond Elementary (Q2828216) (← links)