Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W32260586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120536 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds on synchronizing nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Theory of Automata and Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of the shortest carefully synchronizing words / 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: Modifying the Upper Bound on the Length of Minimal Synchronizing Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank

Latest revision as of 17:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Synchronization of Automata with One Undefined or Ambiguous Transition
scientific article

    Statements

    Synchronization of Automata with One Undefined or Ambiguous Transition (English)
    0 references
    0 references
    20 September 2012
    0 references
    0 references
    synchronizing words
    0 references
    careful synchronization
    0 references
    nondeterministic automata
    0 references
    computational complexity
    0 references
    0 references