Schnoebelen, Philippe

1. Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering
   2017/01/25 by Halfon, Simon, Schnoebelen, Philippe, Zetzsche, Georg · 1 citation
   #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
2. The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering
   2019/04/24 by Jean Goubault-Larrecq, Goubault-Larrecq, Jean, Simon Halfon +7 · 1 citation
   Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #semigroups and automata theory
3. On flat lossy channel machines
   2020/07/10 by Schnoebelen, Philippe · 1 citation
   #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
4. On arch factorization and subword universality for words and compressed words
   2023/04/24 by Schnoebelen, Philippe, Veron, Julien · 1 citation
   #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)