Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1132524622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation between preset distinguishing sequences and synchronizing sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Homing Sequences for Nondeterministic Finite State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of existence of homing sequences for nondeterministic finite state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing finite-state machines: state identification and verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457912 / rank
 
Normal rank

Latest revision as of 19:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
scientific article

    Statements

    Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (English)
    0 references
    0 references
    0 references
    23 September 2015
    0 references
    nondeterministic finite-state machines
    0 references
    homing sequence
    0 references
    homing word
    0 references
    distinguishing sequence
    0 references
    distinguishing word
    0 references
    synchronizing sequence
    0 references
    synchronizing word
    0 references

    Identifiers