The following pages link to Prateek Karandikar (Q2354595):
Displaying 12 items.
- (Q896682) (redirect page) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- On the index of Simon's congruence for piecewise testability (Q2512830) (← links)
- Unidirectional Channel Systems Can Be Tested (Q2915167) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems (Q4910425) (← links)
- On Reachability for Unidirectional Channel Systems Extended with Regular Tests (Q5246728) (← links)
- (Q5278312) (← links)
- The Height of Piecewise-Testable Languages with Applications in Logical Complexity (Q5278426) (← links)
- (Q5376657) (← links)
- On the State Complexity of Closures and Interiors of Regular Languages with Subwords (Q5496192) (← links)
