Pages that link to "Item:Q2881089"
From MaRDI portal
The following pages link to Alternating register automata on finite words and trees (Q2881089):
Displayed 14 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Reasoning about integrity constraints for tree-structured data (Q1650919) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Automated Program Verification (Q2799160) (← links)
- On Freeze LTL with Ordered Attributes (Q2811345) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- (Q4972736) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- Set augmented finite automata over infinite alphabets (Q6067325) (← links)