Pages that link to "Item:Q846359"
From MaRDI portal
The following pages link to On notions of regularity for data languages (Q846359):
Displayed 17 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Walking on data words (Q504989) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Streamable regular transductions (Q2286735) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- Learning Tree Languages (Q2963598) (← links)
- ML and Extended Branching VASS (Q2988645) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Learning Transparent Data Automata (Q5166760) (← links)
- Set augmented finite automata over infinite alphabets (Q6067325) (← links)