Results 41 to 50 of about 194,426 (295)
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
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems
, 2009 We consider parallel communicating pushdown automata systems (PCPA) and define a property called known communication for it. We use this property to prove that the power of a variant of PCPA, called returning centralized parallel communicating pushdown ...
Bianca Truthe +14 more
core +2 more sources
Approximate comparison of distance automata [PDF]
, 2012 Distance automata are automata weighted over the semiring (N∪ {∞}, min,+) (the tropical semiring). Such automata compute functions from words to N ∪{∞} such as the number of occurrences of a given letter.
Colcombet, T., Daviaud, L.
core +4 more sources
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
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests [PDF]
, 2014 We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea
Bouajjani A. +10 more
core +5 more sources
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