Results 41 to 50 of about 63,385 (219)
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
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
Nature, Artifice, and Discovery in Descartes’ Mechanical Philosophy
Philosophies, 2023 It is often assumed that in the collapse of the Aristotelian distinction between art and nature that results from the rise of mechanical philosophies in the early modern period, the collapse falls on the side of art.
Deborah Jean Brown
doaj +1 more source
Branching Automata and Pomset Automata.
, 2021 We compare, in terms of expressive power, two notions of automata recognizing finite N-free pomsets: branching automata by Lodaya and Weil [Lodaya and Weil, 1998; Lodaya and Weil, 1998; Lodaya and Weil, 2000; Lodaya and Weil, 2001] and pomset automata by Kappé, Brunet, Luttik, Silva and Zanasi [Kappé et al., 2018].
openaire +3 more sources
Heuristic optimization methods for linear ordering of automata [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. ИнформатикаThe rapid development of society is associated with two key areas of science and technology: methods of working with Big Data and Artificial Intelligence.
Farakhutdinov, Renat Abuhanovich
doaj +1 more source
A unifying approach for multistack pushdown automata [PDF]
, 2014 We give a general approach to show the closure under complement and decide the emptiness for many classes of multistack visibly pushdown automata (Mvpa). A central notion in our approach is the visibly path-tree, i.e., a stack tree with the encoding of a
Salvatore La Torre +5 more
core +1 more source
On Semantically-Deterministic Automata [PDF]
, 2023 Nondeterminism is a fundamental notion in Theoretical Computer Science. A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic choices in the automaton lead to equivalent states.
Abu Radi, Bader, Kupferman, Orna
core +1 more source
Theoretical Computer Science, 2012 Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction ...
Fumiya Okubo +2 more
openaire +2 more sources
Journal of Computer and System Sciences, 2015 The contribution discusses the compressibility of normal words by various finite-state devices. Roughly speaking, a normal word is an infinite word such that each given block of \(n\) letters occurs (in the limit) as often as each other block of \(n\) letters.
Verónica Becher +2 more
openaire +3 more sources