Prateek Karandikar

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The ideal approach to computing closed subsets in well-quasi-orderings Trends in Logic	2020-07-08	Paper
scientific article; zbMATH DE number 7056230 (Why is no real title available?) (available as arXiv preprint)	2019-05-17	Paper
The height of piecewise-testable languages with applications in logical complexity	2017-07-19	Paper
Decidability in the logic of subsequences and supersequences (available as arXiv preprint)	2017-07-13	Paper
On the state complexity of closures and interiors of regular languages with subwords and superwords Theoretical Computer Science	2015-12-10	Paper
Generalized Post embedding problems Theory of Computing Systems	2015-07-20	Paper
On reachability for unidirectional channel systems extended with regular tests Logical Methods in Computer Science	2015-04-22	Paper
On the index of Simon's congruence for piecewise testability Information Processing Letters	2015-01-30	Paper
On the index of Simon's congruence for piecewise testability Information Processing Letters	2015-01-30	Paper
On the state complexity of closures and interiors of regular languages with subwords Descriptional Complexity of Formal Systems	2014-08-07	Paper
The parametric ordinal-recursive complexity of Post embedding problems Lecture Notes in Computer Science	2013-03-18	Paper
Unidirectional channel systems can be tested Lecture Notes in Computer Science	2012-09-21	Paper
Cutting through regular Post embedding problems Lecture Notes in Computer Science	2012-09-10	Paper

Research outcomes over time

This page was built for person: Prateek Karandikar