Pages that link to "Item:Q5573974"
From MaRDI portal
The following pages link to A Note on Pushdown Store Automata and Regular Systems (Q5573974):
Displayed 18 items.
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- Look-ahead on pushdowns (Q579952) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- A closure property of deterministic context-free languages (Q1149789) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- On store languages and applications (Q2417850) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- The structure of index sets and reduced indexed grammars (Q3479538) (← links)
- Generators of regular languages (Q3886888) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Sequential monotonicity for restarting automata (Q5441545) (← links)
- On regular expressions and regular canonical systems (Q5569116) (← links)