The following pages link to (Q3484362):
Displaying 8 items.
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379) (← links)
- Arithmetics properties of substitutions and infinite automata (Q2372784) (← links)
- REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (Q3503088) (← links)
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)
