Pages that link to "Item:Q3056277"
From MaRDI portal
The following pages link to FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT (Q3056277):
Displaying 14 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- (Q5028487) (← links)
- (Q5089311) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- (Q5101342) (← links)
- (Q5856426) (← links)
