Cellular automata and formulae on monoids

被引：3
|
作者：
Ishida, Toshikazu [1 ]
Inokuchi, Shuichi [2 ]
Kawahara, Yasuo [3 ]
机构：
[1] Center for Fundamental Education, Kyushu Sangyo University, Fukuoka,813-8503, Japan
[2] Fukuoka Institute of Technology, Fukuoka,811-0295, Japan
[3] Kyushu University, Fukuoka, Japan
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8751卷
关键词：
8;
D O I：
10.1007/978-3-319-11520-7_7
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：55 / 64
相关论文
共 50 条
  • [1] Cellular Automata and Formulae on Monoids
    Ishida, Toshikazu
    Inokuchi, Shuichi
    Kawahara, Yasuo
    [J]. CELLULAR AUTOMATA: 11TH INTERNATIONAL CONFERENCE ON CELLULAR AUTOMATA FOR RESEARCH AND INDUSTRY, 2014, 8751 : 55 - 64
  • [2] Groups and Monoids of Cellular Automata
    Salo, Ville
    [J]. CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015, 2015, 9099 : 17 - 45
  • [3] On Finite Monoids of Cellular Automata
    Castillo-Ramirez, Alonso
    Gadouleau, Maximilien
    [J]. CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2016, 2016, 9664 : 90 - 104
  • [4] Propositional Logic and Cellular Automata on Monoids
    Ishida, Toshikazu
    Inokuchi, Shuichi
    Kawahara, Yasuo
    [J]. JOURNAL OF CELLULAR AUTOMATA, 2017, 12 (1-2) : 27 - 45
  • [5] Generating infinite monoids of cellular automata
    Castillo-Ramirez, Alonso
    [J]. JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2022, 21 (11)
  • [6] Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata
    Castillo-Ramirez, Alonso
    Sanchez-Alvarez, Miguel
    [J]. CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS (AUTOMATA 2019), 2019, 11525 : 48 - 61
  • [7] ACME: Automata with Counters, Monoids and Equivalence
    Fijalkow, Nathanael
    Kuperberg, Denis
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2014, 2014, 8837 : 163 - 167
  • [8] Characteristic formulae for timed automata
    Aceto, L
    Ingólfsdóttir, A
    Pedersen, ML
    Poulsen, J
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (06): : 565 - 584
  • [9] MONOIDS DESCRIBED BY PUSHDOWN-AUTOMATA
    PELLETIER, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 464 : 195 - 203
  • [10] RABIN TREE AUTOMATA AND FINITE MONOIDS
    BEAUQUIER, D
    PODELSKI, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (01) : 13 - 25
12345