Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Complexity of Preimage Problems for Deterministic Finite Automata
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.MFCS.2018.32 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Reset Thresholds with Greedy Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing generalized monotonic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Algorithmic Problems about Synchronizing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Probability of Being Synchronizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic synchronization criterion and computing reset words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest synchronizing strings for Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely Reachable Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Inapproximability of the Shortest Reset Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Strategies under Partial Observability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the shortest reset words of synchronizing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Reset Words in Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial complete problems in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Černý conjecture for one-cluster automata with prime length cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata preserving a chain of partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a problem concerning reset words for Eulerian binary automata / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2018.html#BerlinkovFS18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2798896350 / rank
 
Normal rank
Property / title
 
Complexity of Preimage Problems for Deterministic Finite Automata (English)
Property / title: Complexity of Preimage Problems for Deterministic Finite Automata (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.MFCS.2018.32 / rank
 
Normal rank

Latest revision as of 15:37, 30 December 2024

scientific article; zbMATH DE number 7378349
Language Label Description Also known as
English
Complexity of Preimage Problems for Deterministic Finite Automata
scientific article; zbMATH DE number 7378349

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    avoiding word
    0 references
    extending word
    0 references
    extensible subset
    0 references
    reset word
    0 references
    synchronizing automaton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Complexity of Preimage Problems for Deterministic Finite Automata (English)
    0 references

    Identifiers