Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Cellular automata. --- Computational complexity. --- Automates cellulaires --- Complexité de calcul (Informatique) --- Cellular automata --- Computational complexity --- #SBIB:316.23H1 --- #SBIB:316.23H2 --- #SBIB:16G --- #WSCH:AAS2 --- 5 --- 519.6 --- 004 --- 51 --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- wetenschap --- wetenschapstheorie --- computers --- wiskunde --- fysica --- biologie --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Kennissociologie --- Sociologie van de wetenschappen --- Logica en wetenschapsleer --- Wetenschappen --- Computerwiskunde --- Computerkunde --- Wiskunde --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Cellulaire automaten --- Complexiteit van berekening --- Cellulaire automaten. --- Complexiteit van berekening. --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Computational Complexity --- Complexité de calcul (Informatique) --- Systèmes, Conception de --- System design --- System design. --- Systèmes, Conception de