107 citations · 618 across the 21 of their papers we have counts for
Showing 2012 · cs.LOShow all
2 papers · 2 filters
cs.LO2012★ 8 cited
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Prateek Karandikar, Sylvain Schmitz
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to pro…
cs.LO2012★ 2 cited
Model Checking Parse Trees
Anudhyan Boral, Sylvain Schmitz
Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentive…