The following pages link to Fresh-register automata (Q5408551):
Displayed 17 items.
- Program equivalence in a simple language with state (Q456473) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- (Q4972736) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- (Q5013882) (← links)
- Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
- (Q5875386) (← links)
- A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
- On-the-fly bisimilarity checking for fresh-register automata (Q6168987) (← links)