Pages that link to "Item:Q2353403"
From MaRDI portal
The following pages link to Regular expressions for data words (Q2353403):
Displaying 11 items.
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- (Q5091269) (← links)
- (Q5155690) (← links)
- (Q5856426) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
