Pages that link to "Item:Q4982987"
From MaRDI portal
The following pages link to Automata, Universality, Computation (Q4982987):
Displaying 17 items.
- The Common Structure of the Curves Having a Same Gauss Word (Q4982988) (← links)
- Logical Theory of the Additive Monoid of Subsets of Natural Integers (Q4982989) (← links)
- Some Reflections on Mathematics and Its Relation to Computer Science (Q4982990) (← links)
- Sampling a Two-Way Finite Automaton (Q4982991) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- Constructing Reversible Turing Machines by Reversible Logic Element with Memory (Q4982993) (← links)
- The Grossone Methodology Perspective on Turing Machines (Q4982994) (← links)
- On Parallel Array P Systems (Q4982995) (← links)
- Small P Systems Defining Non-semilinear Sets (Q4982996) (← links)
- Generalized Communicating P Automata (Q4982997) (← links)
- Computational Models Based on Splicing (Q4982998) (← links)
- Linear Cellular Automata and Decidability (Q4982999) (← links)
- Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w) (Q4983000) (← links)
- Broadcasting Automata and Patterns on ℤ2 (Q4983001) (← links)
- Real-Time Prime Generators Implemented on Small-State Cellular Automata (Q4983004) (← links)
- Phyllosilicate Automata (Q4983005) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
