The following pages link to (Q4065052):
Displaying 6 items.
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- A V log V algorithm for isomorphism of triconnected planar graphs (Q2264677) (← links)
- The conjecture of Fliess on commutative context-free languages (Q3476286) (← links)
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
- (Q4281522) (← links)