activity
20212025
most citedConstructing Deterministic Parity Automata from Positive and Negative Examples

4 citations · 6 across the 2 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.FL2021★ 2 cited

Constructing deterministic -automata from examples by an extension of the RPNI algorithm

León Bohn, Christof Löding

The RPNI algorithm (Oncina, Garcia 1992) constructs deterministic finite automata from finite sets of negative and positive example words. We propose and analyze an extension of th…