Cargando…
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata: sublinear-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in...
Autor principal: | Modanese, Augusto |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247883/ http://dx.doi.org/10.1007/978-3-030-48516-0_19 |
Ejemplares similares
-
Sublinear scaling of the cellular proteome with ploidy
por: Yahya, G., et al.
Publicado: (2022) -
Computational analysis of one-dimensional cellular automata
por: Voorhees, Burton H
Publicado: (1996) -
Sublinear domination and core–periphery networks
por: Papachristou, Marios
Publicado: (2021) -
A New Binning Method for Metagenomics by One-Dimensional Cellular Automata
por: Lin, Ying-Chih
Publicado: (2015) -
Automata and languages
por: Howie, John M.
Publicado: (1991)