León Bohn
YOU?
Author Swipe
View article: Saturation Problems for Families of Automata
Saturation Problems for Families of Automata Open
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 component corresponds to a prefix of the UP-word, and the …
View article: Constructing Deterministic Parity Automata from Positive and Negative Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples Open
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 that this algorithm is complete for the class of $\omega$-re…
View article: Constructing Deterministic Parity Automata from Positive and Negative Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples Open
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 that this algorithm is complete for the class of $ω$-regular…
View article: Constructing deterministic $ω$-automata from examples by an extension of the RPNI algorithm
Constructing deterministic $ω$-automata from examples by an extension of the RPNI algorithm Open
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 this algorithm to deterministic $ω$-automata with different t…
View article: Constructing deterministic $\omega$-automata from examples by an extension of the RPNI algorithm
Constructing deterministic $\omega$-automata from examples by an extension of the RPNI algorithm Open
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 this algorithm to deterministic $\omega$-automata with differ…
View article: Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm Open
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 this algorithm to deterministic ω-automata with different typ…