Results 31 to 40 of about 9,410 (233)
Clocks, Automata and the Mechanization of Nature (1300–1600)
Philosophies, 2022 This paper aims at tracking down, by looking at late medieval and early modern discussions over the ontological status of artifacts, the main steps of the process through which nature became theorized on a mechanistic model in the early 17th century. The
Sylvain Roudaut
doaj +1 more source
UNAMBIGUOUS CONSTRAINED AUTOMATA [PDF]
International Journal of Foundations of Computer Science, 2012 The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA. Problems decidable for deterministic CA are nonetheless shown to remain decidable for unambiguous CA, and testing for regularity is added to this set of decidable ...
Cadilhac, Michaël +2 more
openaire +2 more sources
Recurrent Pattern Modelling in a Corpus of Armenian Manuscript Colophons [PDF]
Journal of Data Mining and Digital Humanities, 2018 Colophons of Armenian manuscripts are replete with yet untapped riches. Formulae are not the least among them: these recurrent stereotypical patterns conceal many clues as to the schools and networks of production and diffusion of books in Armenian ...
Emmanuel Van Elverdinghe
doaj +1 more source
SHRINKING RESTARTING AUTOMATA [PDF]
International Journal of Foundations of Computer Science, 2005 Restarting automata were introduced by Jančar et al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word.
Jurdziński, Tomasz, Otto, Friedrich
openaire +2 more sources
Algebras with actions and automata
International Journal of Mathematics and Mathematical Sciences, 1982 In the present paper we want to give a common structure theory of left action, group operations, R-modules and automata of different types defined over various kinds of carrier objects: sets, graphs, presheaves, sheaves, topological spaces (in particular:
W. Kühnel +3 more
doaj +1 more source
Constructions for Clumps Statistics. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This object has first been studied by Schbath with the aim of counting the number of occurrences
Frédérique Bassino +3 more
doaj +1 more source
Theoretical Computer Science, 2020 An Automata Network is a map ${f:Q^n\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be viewed as a network of $n$ entities, each holding a state from $Q$, and evolving according to a deterministic synchronous update rule in such a way that each entity only depends on its neighbors in the network's graph, called interaction graph. A major trend
Bridoux, Florian +2 more
openaire +4 more sources
QUANTUM COUNTER AUTOMATA [PDF]
International Journal of Foundations of Computer Science, 2012 The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA.
Say, A. C. Cem, Yakaryilmaz, Abuzer
openaire +3 more sources
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS 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