Pages that link to "Item:Q4174788"
From MaRDI portal
The following pages link to The decidability of equivalence for deterministic stateless pushdown automata (Q4174788):
Displaying 15 items.
- On some decision questions concerning pushdown machines (Q593781) (← links)
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- The simultaneous accessibility of two configurations of two equivalent DPDA's (Q1152220) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
- On the decidability of equivalence for deterministic pushdown transducers (Q1158772) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)
