A study of modelling and computability problems on cellular automata セル構造オートマタ空間上のモデリングと計算可能性に関する研究

Access this Article

Search this Article

Author

    • 古東, 馨 コトウ, カオル

Bibliographic Information

Title

A study of modelling and computability problems on cellular automata

Other Title

セル構造オートマタ空間上のモデリングと計算可能性に関する研究

Author

古東, 馨

Author(Another name)

コトウ, カオル

University

東京電機大学

Types of degree

工学博士

Grant ID

乙第34号

Degree year

1990-07-04

Note and Description

博士論文

Table of Contents

  1. Table of Contents / p2 (0004.jp2)
  2. Acknowledgements / p1 (0003.jp2)
  3. Table of Contents / p2 (0004.jp2)
  4. Table of Symbols / p4 (0006.jp2)
  5. Bibliography / p6 (0008.jp2)
  6. Chapter1 Introduction / p1 (0016.jp2)
  7. 1.1 Motivation for the Study / p1 (0016.jp2)
  8. 1.2 Concise Survey of Cellular Automata and Related Studies / p2 (0017.jp2)
  9. 1.3 Main Studies / p4 (0019.jp2)
  10. 1.4 Another Motivation of the Works / p7 (0022.jp2)
  11. Chapter2 Basic Definitions / p9 (0024.jp2)
  12. 2.1 Algebra on Sets / p9 (0024.jp2)
  13. 2.2 Introductory Definitions of Graphs / p13 (0028.jp2)
  14. 2.3 Alphabets, Strings, and Languages / p17 (0032.jp2)
  15. 2.4 Grammars and Automata / p22 (0037.jp2)
  16. Chapter3 Cellular Automata / p35 (0050.jp2)
  17. 3.1 Cellular Automata and Tessellation Automata / p35 (0050.jp2)
  18. 3.2 Tessellation Automata on Blocked Spaces / p44 (0059.jp2)
  19. 3.3 Simulation of Tessellation Automata / p48 (0063.jp2)
  20. Chapter4 Busy Beaver Problem in Cellular Spaces / p58 (0073.jp2)
  21. 4.1 Cellular Automata as the Growth Models / p58 (0073.jp2)
  22. 4.2 Simulation of a Quasi-Busy Beaver by a Busy Beaver / p63 (0078.jp2)
  23. 4.3 Proto Busy Beavers / p70 (0085.jp2)
  24. 4.4 Busy beavers in a One-dimensional Cellular Space / p74 (0089.jp2)
  25. Chapter5 The Completeness Problem of One-dimensional Tessellation Automata with Injective Functions / p85 (0100.jp2)
  26. 5.1 Introduction / p85 (0100.jp2)
  27. 5.2 Completeness Problem in the One-dimensional,Binary State, Scope-3, Tessellation automaton / p87 (0102.jp2)
  28. 5.3 Injective Functions and Their Classification / p90 (0105.jp2)
  29. 5.4 Incompleteness of M₁₂₃ / p104 (0119.jp2)
  30. Chapter6 Conclusion / p114 (0129.jp2)
  31. Appendix A Global Structure of STOP / p118 (0133.jp2)
  32. Appendix B Examples of Automata Calculation in STOP / p124 (0139.jp2)
2access

Codes

  • NII Article ID (NAID)
    500000073349
  • NII Author ID (NRID)
    • 8000000073545
  • DOI(NDL)
  • NDLBibID
    • 000000237663
  • Source
    • NDL ONLINE
    • NDL Digital Collections

Export

Page Top