Results 81 to 90 of about 7,198 (311)
Decidability of trajectory-based equations
, 2005 We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the operations of concatenation, insertion, shuffle, quotient, sequential and ...
Domaratzki, Michael +3 more
core +1 more source
Decidability of the HD0L ultimate periodicity problem [PDF]
, 2013 In this paper we prove the decidability of the HD0L ultimate periodicity ...
Durand, Fabien, Fabien Durand
core +2 more sources
Decidability Problems for Actor Systems [PDF]
Logical Methods in Computer Science, 2014 We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness.
Frank De Boer +3 more
doaj +1 more source
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Languages, Decidability, and Complexity
, 2013 International audienceThis chapter presents a brief introduction to the theory of automata, formal languages, decidability, and ...
Stefan Haar +3 more
core +1 more source
Decidability for Sturmian words [PDF]
Logical Methods in Computer ScienceWe show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of ...
Philipp Hieronymi +5 more
doaj +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
FEBS Letters, EarlyView.Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil +4 more
wiley +1 more source
Decidability of Split Equivalence
, 2002 We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1=E2 true for all instantiations of its variables by strings?
Rabinovich, A., Abramson, Y.
core +1 more source
A Decidable Extension of Data Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Data automata on data words is a decidable model proposed by Bojańczyk et al. in 2006. Class automata, introduced recently by Bojańczyk and Lasota, is an extension of data automata which unifies different automata models on data words.
Zhilin Wu
doaj +1 more source