Pages that link to "Item:Q1183602"
From MaRDI portal
The following pages link to Iterated stack automata and complexity classes (Q1183602):
Displaying 25 items.
- The grammar of mammalian brain capacity (Q290555) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Visit-bounded stack automata (Q2163998) (← links)
- Weighted automata with storage (Q2280328) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- Corrigendum to: ``Iterated stack automata and complexity classes'' (Q2417858) (← links)
- Iterated pushdown automata and sequences of rational numbers (Q2498918) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- (Q3386623) (← links)
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (Q3533004) (← links)
- (Q3708002) (← links)
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (Q4639894) (← links)
- Tree-stack automata (Q4879207) (← links)
- Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems (Q5005159) (← links)
- (Q5119391) (← links)
- On dynamics of automata with a stack (Q5259053) (← links)
- New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines (Q6040662) (← links)
- Visit-bounded stack automata (Q6056625) (← links)
- Parameterized verification under TSO with data types (Q6535379) (← links)
