2 papers
cs.FL2020
is an -MCFL
Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
Commutative properties in formal languages pose problems at the frontier of computer science, computational linguistics and computational group theory. A prominent problem of this…
cs.FL2016
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
Lorenzo Clemente, Paweł Parys, Sylvain Salvati +1
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We…