Pages that link to "Item:Q1218272"

The following pages link to Deterministic one-counter automata (Q1218272):

Displaying 41 items.

• On some decision questions concerning pushdown machines (Q593781) (← links)
• Inference of deterministic one-counter languages (Q794442) (← links)
• An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
• The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
• Decision problems for pushdown threads (Q884992) (← links)
• New techniques for proving the decidability of equivalence problem (Q913523) (← links)
• Risk assessment for one-counter threads (Q1015382) (← links)
• The equivalence and inclusion problems for NTS languages (Q1083219) (← links)
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
• Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
• The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← 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 result on the equivalence problem for deterministic pushdown automata (Q1230509) (← links)
• On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
• Two decidability results for deterministic pushdown automata (Q1254241) (← links)
• Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
• On equivalence of grammars through transformation trees (Q1259173) (← links)
• On the inference of strategies (Q1263988) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
• Decidability of the equivalence problem for deterministic pushdown automata (Q1816326) (← links)
• Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939) (← 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)
• Counter machines and verification problems. (Q1853523) (← links)
• Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
• Effective bounds for certain functions concerning prime numbers (Q1919163) (← links)
• On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) (Q2399255) (← links)
• Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
• Trace inclusion for one-counter nets revisited (Q2636512) (← links)
• Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
• (Q3384876) (← links)
• Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
• (Q5089304) (← links)
• (Q5089315) (← links)
• The Complexity of Flat Freeze LTL (Q5111647) (← links)
• A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)
• (Q5875390) (← links)
• Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)