A pseudo-random network mobile automaton with linear growth

DOI10.1016/J.IPL.2009.02.023MaRDI QIDQ989450zbMATH OpenOpenAlexFDO

Authors Tommaso Bolognesi

Publication date 20 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.02.023

zbMATH Keywords

cellular automatagraph algorithmsnetwork mobile automatapseudorandom numbers

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Planar trinet dynamics with two rewrite rules
• Growing random graphs with quantum rules
• RANDOMIZED CELLULAR AUTOMATA
• On a random walk that grows its own tree
• scientific article; zbMATH DE number 2170488

Cites work

• Complexity of Langton's ant
• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• Numeration systems and fractal sequences
• Planar trinet dynamics with two rewrite rules
• Planar Trivalent Network Computation
• The On-Line Encyclopedia of Integer Sequences
• Three roads to quantum gravity.

Cited in

(2)

• Planar trinet dynamics with two rewrite rules
• Growing random graphs with quantum rules

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A pseudo-random network mobile automaton with linear growth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989450)