Results 51 to 60 of about 6,170,352 (312)

Bell's Theorem from Moore's Theorem [PDF]

open access: yes, 2012
It is shown that the restrictions of what can be inferred from classically-recorded observational outcomes that are imposed by the no-cloning theorem, the Kochen-Specker theorem and Bell's theorem also follow from restrictions on inferences from ...
Ashby W. R.   +19 more
core   +1 more source

Efficient Implementation for Deterministic Finite Tree Automata Minimization

open access: yesJournal of Computing and Information Technology, 2016
We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized ...
Younes Guellouma, Hadda Cherroun
doaj   +1 more source

On path hypercompositions in graphs and automata

open access: yesMATEC Web of Conferences, 2016
The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph.
Massouros Christos G.
doaj   +1 more source

Sequences of Groups, Hypergroups and Automata of Linear Ordinary Differential Operators

open access: yesMathematics, 2021
The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders.
Jan Chvalina   +3 more
doaj   +1 more source

A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata

open access: yesEntropy, 2019
In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation.
Guangjian Huang   +3 more
doaj   +1 more source

Solomon Marcus Contributions to Theoretical Computer Science and Applications

open access: yesAxioms, 2021
Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised ...
Cristian S. Calude, Gheorghe Păun
doaj   +1 more source

Neural architecture search for resource constrained hardware devices: A survey

open access: yesIET Cyber-Physical Systems, 2023
With the emergence of powerful and low‐energy Internet of Things devices, deep learning computing is increasingly applied to resource‐constrained edge devices.
Yongjia Yang   +4 more
doaj   +1 more source

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

open access: yesFEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source

In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS

open access: yesFEBS Letters, EarlyView.
We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka   +11 more
wiley   +1 more source

On cascade products of answer set programs

open access: yes, 2014
Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or "emulated") by a ...
Antić, Christian
core   +1 more source

Home - About - Disclaimer - Privacy