Results 41 to 50 of about 5,611,476 (304)
Classical Automata on Promise Problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata by using a ...
Viliam Geffert, Abuzer Yakaryilmaz
doaj +1 more source
Constructively Formalizing Automata Theory [PDF]
, 2000 We present a constructive formalization of the Myhill-Nerode theorem on the minimization of nite automata that follows the account in Hopcroft and Ullman's book Formal Languages and Their Relation to Automata. We chose to formalize this theorem because it illustrates many points critical to formalization of computational mathematics, especially the ...
Constable, Robert L. +3 more
openaire +3 more sources
Combinatorics, Automata and Number Theory
, 2010 editorial reviewedThis collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory.
core +1 more source
FEBS Letters, EarlyView.How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
The Language Theory of Bounded Context-Switching
, 2010 Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form of reachability has become popular in the formal verification ...
Parlato, Gennaro +2 more
core +2 more sources
Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein
FEBS Letters, EarlyView.Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux +7 more
wiley +1 more source
Can Nondeterminism Help Complementation? [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Yang Cai, Ting Zhang
doaj +1 more source
Effective theories for circuits and automata [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2011 Abstracting an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological, computational, and social systems makes the problem harder.
openaire +4 more sources
Non-blocking supervisory control for initialised rectangular automata [PDF]
, 2004 We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised.
Spathopoulos, M.P. +1 more
core +2 more sources
Molecular Oncology, EarlyView.We identify USP29 as the only DUB mirroring CA9 expression, a marker of hypoxia and HIF pathway activation associated with PCA aggressiveness. USP29 stabilizes HIF‐1α and HIF‐2α via a noncanonical mechanism that is independent of PHD/pVHL activity yet relies on proteasomal regulation, establishing USP29 as a previously unrecognized regulator of hypoxic
Amelie S Schober +16 more
wiley +1 more source