Pages that link to "Item:Q5915651"
From MaRDI portal
The following pages link to Variations of checking stack automata: obtaining unexpected decidability properties (Q5915651):
Displayed 7 items.
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Semilinearity of Families of Languages (Q5859668) (← links)
- (Q5920128) (redirect page) (← links)
- New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines (Q6040662) (← links)
- On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
- Tree-walking-storage automata (Q6088945) (← links)
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies (Q6114832) (← links)