Cellular Automata: Descriptional Complexity and Decidability (Q5112166): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4590910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Operations on Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cellular automata: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast one-way cellular automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3592204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3527018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3450011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular automata with limited inter-cell bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way communication in cellular automata with a fixed number of cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some undecidable problems for parallel communicating finite automata systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signals in one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible computing and cellular automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input-Driven Pushdown Automata with Limited Nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Natural Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Latest revision as of 19:58, 22 July 2024

scientific article; zbMATH DE number 7205925
Language Label Description Also known as
English
Cellular Automata: Descriptional Complexity and Decidability
scientific article; zbMATH DE number 7205925

    Statements

    Cellular Automata: Descriptional Complexity and Decidability (English)
    0 references
    0 references
    0 references
    28 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers