Halfon, Simon

1. Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering
   2017/01/25 by Halfon, Simon, Schnoebelen, Philippe, Zetzsche, Georg · 2 citations
   #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 · 2 citations
   Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #cs.FL #cs.LO #semigroups and automata theory
3. Context-Free Commutative Grammars with Integer Counters and Resets
   2015/11/16 by Dmitry Chistikov, Chistikov, Dmitry, Christoph Haase +3 · 1 citation
   Computer Science · #F.1.1 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL