Pages that link to "Item:Q3703289"
From MaRDI portal
The following pages link to An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289):
Displaying 10 items.
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- Equivalence of simple functions (Q880171) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
- A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)
