Pages that link to "Item:Q4571996"
From MaRDI portal
The following pages link to The equivalence problem for deterministic pushdown automata is decidable (Q4571996):
Displaying 21 items.
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Some properties of iterated languages (Q2011823) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Periodic properties of pushdown automata (Q2288436) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- (Q4989409) (← links)
- (Q5020647) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
- From Security Protocols to Pushdown Automata (Q5277904) (← links)
- The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes (Q5277914) (← links)
- Decidability of DPDA equivalence (Q5941060) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
