Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (Q1596777): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127872426, #quickstatements; #temporary_batch_1723642047871
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5737557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of games of \(\epsilon\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games between automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Lower Bounds for Maze Threadability on Restricted Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phenomenology of excitation in 2-D cellular automata and swarm systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi-like partition of lattice in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for undirected graph traversal by graph automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incomplete Voronoĭ diagram and percolation analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical growth phenomena in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of probabilistic cellular automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast randomized LOGSPACE algorithm for graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on generalized lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in random graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0895-7177(98)00156-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055905380 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127872426 / rank
 
Normal rank

Latest revision as of 14:32, 14 August 2024

scientific article
Language Label Description Also known as
English
Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
scientific article

    Statements

    Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (English)
    0 references
    5 May 2002
    0 references
    Voronoi diagram
    0 references
    finite automata
    0 references
    0 references
    0 references

    Identifiers