Constructing Deterministic Parity Automata from Positive and Negative Examples
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2023
- Urheber
- DOI
-
10.18154/RWTH-2024-02927
- URN
-
urn:nbn:de:101:1-2024032200554297084362
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:43 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bohn, Leon
- Löding, Christof
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2023
Ähnliche Objekte (12)
Constructing Deterministic Parity Automata from Positive and Negative Examples
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Deterministic set automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
State Space Reduction For Parity Automata
Correction to: From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Minimization of Deterministic Fuzzy Tree Automata
Deterministic automata for extended regular expressions
Constructing Fuzzy Graphs from Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Deterministic set automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
State Space Reduction For Parity Automata
Correction to: From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Minimization of Deterministic Fuzzy Tree Automata
Deterministic automata for extended regular expressions
Constructing Fuzzy Graphs from Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
Deterministic set automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
State Space Reduction For Parity Automata
Correction to: From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Minimization of Deterministic Fuzzy Tree Automata
Deterministic automata for extended regular expressions