Results 81 to 90 of about 40,986 (266)

Brain as an Emergent Finite Automaton: A Theory and Three Theorems

, 2015
This paper models a biological brain—excluding motivation (e.g., emotions)—as a Finite Automaton in Developmental Network (FA-in-DN), but such an FA emerges incrementally in DN.
J. Weng
semanticscholar   +1 more source

Addressing persistent challenges in digital image analysis of cancer tissue: resources developed from a hackathon

Molecular Oncology, EarlyView.
Large multidimensional digital images of cancer tissue are becoming prolific, but many challenges exist to automatically extract relevant information from them using computational tools. We describe publicly available resources that have been developed jointly by expert and non‐expert computational biologists working together during a virtual hackathon
Sandhya Prabhakaran, Clarence Yapp, Gregory J. Baker, Johanna Beyer, Young Hwan Chang, Allison L. Creason, Robert Krueger, Jeremy Muhlich, Nathan Heath Patterson, Kevin Sidak, Damir Sudar, Adam J. Taylor, Luke Ternes, Jakob Troidl, Xie Yubin, Artem Sokolov, Darren R. Tyson   +16 more
wiley   +1 more source

Elementary Cellular Automata as Invariant under Conjugation Transformation or Combination of Conjugation and Reflection Transformations, and Applications to Traffic Modeling

Mathematics, 2022
This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell.
Valery Kozlov, Alexander Tatashev, Marina Yashina   +2 more
doaj   +1 more source

TRPM4 contributes to cell death in prostate cancer tumor spheroids, and to extravasation and metastasis in a zebrafish xenograft model system

Molecular Oncology, EarlyView.
Transient receptor potential melastatin‐4 (TRPM4) is overexpressed in prostate cancer (PCa). Knockout of TRPM4 resulted in reduced PCa tumor spheroid size and decreased PCa tumor spheroid outgrowth. In addition, lack of TRPM4 increased cell death in PCa tumor spheroids.
Florian Bochen, Saurav Subedi, Federico La Manna, Sofia Jarrin, Irida Papapostolou, Marianna Kruithof‐de Julio, Christine Peinelt   +6 more
wiley   +1 more source

Regular omega-Languages with an Informative Right Congruence [PDF]

Electronic Proceedings in Theoretical Computer Science, 2018
A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The same
Dana Angluin, Dana Fisman
doaj   +1 more source

Semigroups Arising From Asynchronous Automata [PDF]

arXiv, 2010
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in the class of expanding automaton semigroups, and that the class of expanding automaton semigroups is strictly ...
arxiv  

The Finiteness Problem for Automaton Semigroups is Undecidable [PDF]

International journal of algebra and computation, 2013
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known.
Pierre Gillibert
semanticscholar   +1 more source

Integration of single‐cell and bulk RNA‐sequencing data reveals the prognostic potential of epithelial gene markers for prostate cancer

Molecular Oncology, EarlyView.
Prostate cancer is a leading malignancy with significant clinical heterogeneity in men. An 11‐gene signature derived from dysregulated epithelial cell markers effectively predicted biochemical recurrence‐free survival in patients who underwent radical surgery or radiotherapy.
Zhuofan Mou, Lorna W. Harries
wiley   +1 more source

Zegarmistrzowie, automata i kino

Kwartalnik Filmowy, 2014
Dzieje kina i zegarmistrzostwa są ze sobą silnie powiązane. Bez krzyża maltańskiego, mechanizmu stosowanego w zegarkach od XVIII w., nie byłoby projektora.
Marcin Giżycki
doaj   +1 more source

k-Colorability is Graph Automaton Recognizable [PDF]

, 2014
Automata operating on general graphs have been introduced by virtue of graphoids. In this paper we construct a graph automaton that recognizes $k$-colorable graphs.
arxiv   +1 more source