Synchronization problems in automata without non-trivial cycles (Q5919579): Difference between revisions

From MaRDI portal
Merged Item from Q5920057
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Synchronizing monotonic 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: Completely Reachable Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of R-trivial monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / 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: Primitive Sets of Nonnegative Matrices and Synchronizing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank of a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial complete problems in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset words for commutative and solvable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Synchronization and Careful Synchronization of Binary Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based testing of reactive systems. Advanced lectures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Synchronization in Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization problems in automata without non-trivial cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of known results and research areas for \(n\)-queens / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Road Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank

Revision as of 05:28, 20 July 2024

scientific article; zbMATH DE number 6763324
Language Label Description Also known as
English
Synchronization problems in automata without non-trivial cycles
scientific article; zbMATH DE number 6763324

    Statements

    Synchronization problems in automata without non-trivial cycles (English)
    0 references
    0 references
    20 August 2019
    0 references
    22 August 2017
    0 references
    synchronizing automaton
    0 references
    computational complexity
    0 references
    inapproximability
    0 references
    weakly acyclic automaton
    0 references
    subset rank
    0 references
    synchronizable set
    0 references
    synchronizing automata
    0 references
    weakly acyclic automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references