Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
type: Item
instance of: scholarly article
title: Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
zbMATH Open document ID: 0993.68127
DOI: 10.1016/S0895-7177(98)00156-3
published in: Mathematical and Computer Modelling
publication date: 2002-05-05T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 1737545
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: finite automata
author: Andrew Adamatzky
author: Owen Holland
MaRDI profile type: Publication
cites work: Q5737557
cites work: Description of games of \(\epsilon\)-automata
cites work: Games between automata
cites work: Q3805954
cites work: Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
cites work: Space Lower Bounds for Maze Threadability on Restricted Machines
cites work: Phenomenology of excitation in 2-D cellular automata and swarm systems
cites work: Q4840656
cites work: Voronoi-like partition of lattice in cellular automata
cites work: Time-space tradeoffs for undirected graph traversal by graph automata
cites work: Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: The complexity of computing the permanent
cites work: The incomplete Voronoĭ diagram and percolation analysis
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Q4848559
cites work: Critical growth phenomena in cellular automata
cites work: Statistical mechanics of probabilistic cellular automata.
cites work: Q4308875
cites work: Q3734960
cites work: A fast randomized LOGSPACE algorithm for graph connectivity
cites work: Random walks on generalized lattices
cites work: Q3361866
cites work: Q4851560
cites work: Broadcasting in random graphs
full work available at URL: s0895-7177(98)00156-3
OpenAlex ID: W2055905380
Wikidata QID: Q127872426
Recommended article: Voronoi-like partition of lattice in cellular automata
Recommended article: Q2974159
Recommended article: Complexity and algorithms for computing Voronoi cells of lattices
Recommended article: Q4407636
Recommended article: Approximate Voronoi cells for lattices, revisited
Recommended article: A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Recommended article: A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
Recommended article: Q3772269
Recommended article: On the Voronoi Regions of Certain Lattices
Recommended article: Lattice structures of automata
description: scientific article; zbMATH DE number 1737545