2 papers
cs.FL2022
Generating Tokenizers with Flat Automata
Hans de Nivelle, Dina Muktubayeva
We introduce flat automata for automatic generation of tokenizers. Flat automata are a simple representation of standard finite automata. Using the flat representation, automata ca…
cs.LO2003
Deciding regular grammar logics with converse through first-order logic
Stephane Demri, Hans de Nivelle
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variabl…