Cellular String Generators - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Cellular String Generators

Martin Kutrib
  • Fonction : Auteur
  • PersonId : 884118
Andreas Malcher
  • Fonction : Auteur
  • PersonId : 1038035

Résumé

In contrast to many investigations of cellular automata with regard to their ability to accept inputs under certain time constraints, we are studying here cellular automata towards their ability to generate strings in real time. Structural properties such as speed-up results and closure properties are investigated. On the one hand, constructions for the closure under intersection, reversal, and length-preserving homomorphism are presented, whereas on the other hand the non-closure under union, complementation, and arbitrary homomorphism is obtained. Finally, decidability questions such as emptiness, finiteness, equivalence, inclusion, regularity, and context-freeness are addressed.
Fichier principal
Vignette du fichier
496967_1_En_5_Chapter.pdf (416.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03659467 , version 1 (05-05-2022)

Licence

Paternité

Identifiants

Citer

Martin Kutrib, Andreas Malcher. Cellular String Generators. 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Aug 2020, Stockholm, Sweden. pp.59-70, ⟨10.1007/978-3-030-61588-8_5⟩. ⟨hal-03659467⟩
30 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More