Results 1  10
of
249
Slowly synchronizing automata and digraphs
 InMathematical Foundations of Computer Science 2010, volume 6281 of LNCS
, 2010
"... iv ..."
Exponent Sequences of Labeled Digraphs vs Reset Thresholds of Synchronizing Automata
"... A DFA A = 〈Q, Σ 〉 is called synchronizing if the action of some word w ∈ Σ ∗ resets A, that is, leaves the automaton in one particular state no matter at which state in Q it is applied: q · w = q ′ · w for all q, q ′ ∈ Q. Any such word w is said to be a reset word for the DFA. The minimum length o ..."
Abstract
 Add to MetaCart
threshold (n − 1) 2. In fact, the Čern´y series Cn is the only known infinite series of extreme automata. Besides that, only a few isolated examples of such automata have been found. Moreover, even slowly synchronizing automata, that is, automata with reset length close to the Čern´y bound are very rare
Lower bounds for the length of reset words in eulerian automata
 Int. J. Found. Comput. Sci
, 2013
"... For each odd n ≥ 5 we present a synchronizing Eulerian automaton with n states for which the minimum length of reset words is equal to n 2 −3n+4 2. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its underlying ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
For each odd n ≥ 5 we present a synchronizing Eulerian automaton with n states for which the minimum length of reset words is equal to n 2 −3n+4 2. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its
M.V.: P(l)aying for synchronization
 Implementation and Application of Automata, Lect. Notes Comput. Sci
, 2012
"... ar ..."
Abstract The Specification and Execution of Heterogeneous Synchronous Reactive Systems
"... The need for new languages and paradigms for designing software for embedded computing systems continues to grow as generalpurpose microcontrollers become faster and cheaper. Many of these system need precise control over when things happen, yet few languages provide this facility. Another major ch ..."
Abstract
 Add to MetaCart
challenge is handling the growing complexity of these systems. In this dissertation, I present a new model of computation for embedded system software that is the first to fuse precise control over timing with the ability to build systems from heterogeneous pieces. It combines the synchronous model of time
The Synchronous Boltzmann Machine for Learning and Hardcombinatoric Search
"... In neural network modelling asynchronous Boltzmann machines are widely regarded as a slow learners because their operative mode is not parallel. This is because that part of the theory related to energy minimisation only permits one unit at a time to update its state. Learning with synchronous Boltz ..."
Abstract
 Add to MetaCart
In neural network modelling asynchronous Boltzmann machines are widely regarded as a slow learners because their operative mode is not parallel. This is because that part of the theory related to energy minimisation only permits one unit at a time to update its state. Learning with synchronous
Pros and Cons of three Approaches to the Study of Diffusion in Zeolites: Cellular Automata, Networks and secondorder Markov Models
"... 2La presente tesi e ̀ stata prodotta nell’ambito della scuola di dottorato in Scienze e Tecnologie Chimiche dell’Universita ̀ degli Studi di Sassari, a.a. 20112013 – XXVI ◦ciclo, con il supporto di una borsa di studio finanziata con le risorse del P.O.R. SARDEGNA F.S.E. 20072013 Obiettivo compet ..."
Abstract
 Add to MetaCart
spesso salvifico supporto informatico e non solo. Alberto M. Pintus Pros and Cons of three Approaches to the Study of Diffusion in Zeolites: Cellular Automata, Networks and secondorder Markov Models
Mikhail Berlinkov “Some Methods Related to the Čern´y Conjecture ”......... 10
, 2011
"... is an updated version of the Abstracts containing talks that were actually presented at the Symposium. The original printed version has ISBN 9785965105717.Content Invited lectures 1 Dima Grigoriev “Complexity of solving tropical linear systems and conjecture on a tropical effective Nullstellensa ..."
Abstract
 Add to MetaCart
”.................................. 4 Mikhail Volkov “Exponents of labeled digraphs and synchronizing automata ”.... 4 Luca Q. Zamboni “IPsets defined by words of low complexity ”............ 7 Contributed talks 9 Vitaly A. Baransky, Tatiana A. Senchonok “Chromatic uniqueness of elements of height ≤3 in lattices of complete
The Scrambling Index of Twocolored Wielandt
"... Abstract A digraph is primitive provided there is a positive integer k such that for each pair of vertices u and v there exist walks of length k from u to v and from v to u. The scrambling index of a primitive digraph D is the smallest positive integer k such that for each pair of vertices u and v i ..."
Abstract
 Add to MetaCart
Abstract A digraph is primitive provided there is a positive integer k such that for each pair of vertices u and v there exist walks of length k from u to v and from v to u. The scrambling index of a primitive digraph D is the smallest positive integer k such that for each pair of vertices u and v
Interactive Drama, Art and Artificial Intelligence
, 2002
"... This research was funded in part through fellowships from the Litton and Intel Corporations. Any opinions, findings and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect those of the sponsors. ..."
Abstract

Cited by 60 (5 self)
 Add to MetaCart
This research was funded in part through fellowships from the Litton and Intel Corporations. Any opinions, findings and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect those of the sponsors.
Results 1  10
of
249