1 citations · 1 across the 5 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2015★ 1 cited
On the Complexity of Flanked Finite State Automata
Florent Avellaneda, Silvano Dal Zilio, Jean-Baptiste Raclet
We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity proper…
cs.FL2014
Quotient of Acceptance Specifications under Reachability Constraints
Guillaume Verdier, Jean-Baptiste Raclet
The quotient operation, which is dual to the composition, is crucial in specification theories as it allows the synthesis of missing specifications and thus enables incremental des…