4 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.FL2025
Saturation Problems for Families of Automata
León Bohn, Yong Li, Christof Löding +1
Families of deterministic finite automata (FDFA) represent regular -languages through their ultimately periodic words (UP-words). An FDFA accepts pairs of words, where the first…
cs.FL2023★ 4 cited
Constructing Deterministic Parity Automata from Positive and Negative Examples
León Bohn, Christof Löding
We present a polynomial time algorithm that constructs a deterministic parity automaton (DPA) from a given set of positive and negative ultimately periodic example words. We show t…
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…