On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.3233/fi-222152 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4383956509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Reduction in Incompletely Specified Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient minimization of deterministic weak \(\omega\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On syntactic congruences for \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ω-regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the learnability of infinitary regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular omega languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer aided verification. 18th international conference, CAV 2006, Seattle, WA, USA, August 17--20, 2006. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Rabin Index of a Parity Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Optimizations and Heuristics for Determinization of Büchi Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6168432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Identification of $$\omega $$-Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3233/FI-222152 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:23, 30 December 2024

scientific article; zbMATH DE number 7737447
Language Label Description Also known as
English
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
scientific article; zbMATH DE number 7737447

    Statements

    On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (English)
    0 references
    0 references
    0 references
    14 September 2023
    0 references
    deterministic \(\omega\)-automata
    0 references
    don't care words
    0 references
    learning
    0 references
    minimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references