In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set...
4 KB (453 words) - 06:31, 14 April 2025
second-order automaton may be described as a function f that maps the neighborhood of a cell to a permutation on the states of the automaton. In each time...
6 KB (755 words) - 10:01, 18 October 2024
Permutation City is a 1994 science-fiction novel by Greg Egan that explores many concepts, including quantum ontology, through various philosophical aspects...
15 KB (1,925 words) - 04:13, 4 February 2025
A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells...
71 KB (9,018 words) - 09:59, 18 October 2024
permutation Claw-free permutation Heap's algorithm Permutation automaton Schreier vector Sorting algorithm Sorting network Substitution–permutation network...
4 KB (282 words) - 11:52, 17 July 2024
In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise...
28 KB (3,537 words) - 22:01, 27 March 2025
transformation (or composition) monoid. This is the semigroup analogue of a permutation group. A transformation semigroup of a set has a tautological semigroup...
8 KB (1,052 words) - 16:04, 11 December 2024
Nicholas (June 5, 2025). "What Are the Superman Robots in the 2025 Movie? Automatons Explained". SuperHeroHype. Archived from the original on June 5, 2025...
210 KB (15,605 words) - 21:26, 26 June 2025
notion of expanding the state-set of the original automaton is essential (for the non-permutation automata case). Many proofs and constructions now exist...
20 KB (2,310 words) - 07:39, 4 June 2025
universe is a rewriting network, not a cellular automaton, as Wolfram himself has suggested a cellular automaton cannot account for relativistic features such...
33 KB (3,449 words) - 18:52, 12 April 2025
deterministic finite automaton (DFA) deterministic finite state machine deterministic finite tree automaton deterministic pushdown automaton (DPDA) deterministic...
35 KB (3,135 words) - 18:46, 6 May 2025
every possible permutation of a specified character set is called a superpermutation. Brace notation Substring index Suffix automaton Lothaire, M. (1997)...
6 KB (831 words) - 07:25, 30 May 2025
bounded nondeterministic Turing machine, also called a linear bounded automaton. That is a non-deterministic Turing machine with a tape of only k n {\displaystyle...
9 KB (1,351 words) - 16:32, 24 June 2025
Abelian sandpile model (category Cellular automaton rules)
to this model as the Abelian sandpile model. The model is a cellular automaton. In its original formulation, each site on a finite grid has an associated...
33 KB (5,017 words) - 09:06, 27 May 2025
can be adapted to work with any ordered sequence of elements, such as permutations of digits or shapes. A notable variant is the bitwise trie, which uses...
31 KB (3,331 words) - 03:21, 16 June 2025
surely survive. Bootstrap percolation can be interpreted as a cellular automaton, resembling Conway's Game of Life, in which live cells die when they have...
6 KB (766 words) - 09:10, 22 April 2025
Permanent Permutation Enumerations of specific permutation classes Josephus permutation Permutation matrix Permutation pattern Permutation (disambiguation)...
7 KB (626 words) - 21:27, 20 August 2024
Automaton Olympia's Cabinet of Curiosities (1996). This series is a video installation recording the index of decorations belonging to an automaton,...
10 KB (1,115 words) - 16:44, 27 February 2025
not always find the shortest possible synchronizing word for a given automaton; as Eppstein also shows, the problem of finding the shortest synchronizing...
8 KB (890 words) - 06:31, 14 April 2025
Turing completeness. Olmstead believed Malbolge to be a linear bounded automaton. There is a discussion about whether one can implement sensible loops...
21 KB (1,644 words) - 08:54, 9 June 2025
includes the Autoverse, an artificial life simulator based on a cellular automaton complex enough to represent the substratum of an artificial chemistry...
10 KB (1,291 words) - 10:30, 5 October 2024
evolution of simulated beings, which in the novel happens with a cellular automaton called Autoverse. In an FAQ after the novel was published, Egan wrote...
7 KB (770 words) - 06:19, 10 July 2024
back to the 1960s, states that the entire universe is a huge cellular automaton which continuously updates its rules. Recently it has been suggested that...
44 KB (5,191 words) - 00:07, 23 May 2025
If they aren't beautiful, nothing is". Argument from beauty Cellular automaton Descriptive science Fluency heuristic Golden ratio Mathematics and architecture...
30 KB (3,537 words) - 03:53, 24 June 2025
List of algorithms (section Sequence permutations)
deterministic finite automaton Powerset construction: algorithm to convert nondeterministic automaton to deterministic automaton. Tarski–Kuratowski algorithm:...
72 KB (7,951 words) - 17:13, 5 June 2025
connection the stack alphabet in the formal definition of a pushdown automaton, or the tape-alphabet in the formal definition of a Turing machine the...
62 KB (6,019 words) - 01:11, 9 June 2025
Rosenblatt, Frank (January 1957). The Perceptron: A Perceiving and Recognizing Automaton (Project PARA) (PDF) (Report). Cornell Aeronautical Laboratory, Inc. Report...
37 KB (5,184 words) - 13:04, 8 June 2025
Sanders Peirce. permutation The structural rule that allows one to exchange two formulas that are on the same side of the arrow. permutation invariant A property...
271 KB (30,237 words) - 18:29, 25 April 2025
four-way set associative. Effectively, the hardware maintains a simple permutation from virtual address to cache index, so that no content-addressable memory...
97 KB (13,327 words) - 00:25, 25 June 2025
the (asymptotical) stability of motion? Is every reversible cellular automaton in three or more dimensions locally reversible? Sudoku: How many puzzles...
195 KB (20,069 words) - 08:05, 26 June 2025