Pages that link to "Item:Q3962488"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors (Q3962488):
Displaying 9 items.
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)