Search results for "AUTOMATA"
showing 10 items of 453 documents
The Expressibility of Languages and Relations by Word Equations
1997
Classically, several properties and relations of words, such as being a power of a same word, can be expressed by using word equations. This paper is devoted to study in general the expressive power of word equations. As main results we prove theorems which allow us to show that certain properties of words are not expressible as components of solutions of word equations. In particular, the primitiveness and the equal length are such properties, as well as being any word over a proper subalphabet.
A word prediction methodology for automatic sentence completion
2015
Word prediction generally relies on n-grams occurrence statistics, which may have huge data storage requirements and does not take into account the general meaning of the text. We propose an alternative methodology, based on Latent Semantic Analysis, to address these issues. An asymmetric Word-Word frequency matrix is employed to achieve higher scalability with large training datasets than the classic Word-Document approach. We propose a function for scoring candidate terms for the missing word in a sentence. We show how this function approximates the probability of occurrence of a given candidate word. Experimental results show that the proposed approach outperforms non neural network lang…
Analysing urban development with decision tree based cellular automata. Toward an automatic transition rule creation process.
2016
International audience
An Automata-Based Cardiac Electrophysiology Simulator to Assess Arrhythmia Inducibility
2022
Personalized cardiac electrophysiology simulations have demonstrated great potential to study cardiac arrhythmias and help in therapy planning of radio-frequency ablation. Its application to analyze vulnerability to ventricular tachycardia and sudden cardiac death in infarcted patients has been recently explored. However, the detailed multi-scale biophysical simulations used in these studies are very demanding in terms of memory and computational resources, which prevents their clinical translation. In this work, we present a fast phenomenological system based on cellular automata (CA) to simulate personalized cardiac electrophysiology. The system is trained on biophysical simulations to re…
BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS
2010
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalized to non periodic infinite words as well.
Sobre substitució lingüística i autòmats cel.lulars (SLAC): decurs de la investigació
2010
Hem optat per focalitzar la nostra investigació, tot i l'ampla aplicabilitat de la recerca, en la detecció del futur de la nostra llengua a partir dels pressupòsits de la Psicologia Social Computacional. I això mitjançant la utilització de la simulació informàtica, basada en els autòmats cel·lulars, que ha donat els primers resultats que presentem i explicitem en la nostra aportació a l'ANUARI. Així, hi abordem el futur de la llengua pròpia a partir de la conducta referida als parlants del País Valencià i amb la intenció d'esbrinar la reversió de la substitució lingüística.
Jauni ieskati kvantu automātu stāvokļu skaita efektivitātē
2022
Kvantu galīgi automāti var sasniegt eksponenciālu stāvokļu skaitu efektivitāti, salīdzinot ar determinētiem galīgiem automātiem. Viena problēma, kurā ir zināms, ka kvantu galīgiem automātiem ir eksponenciālas priekšrocības, ir MODn problēma, taču nav zināma metode, kā uzkonstruēt tādu kvantu automātu. Šajā darbā eksponenciāli efektīvie MODn algoritmi tiek vispārināti jaunā algoritmā, kas samazina vajadzīgo stāvokļu skaitu. Jaunā algoritma saaistības ar esošiem virzieniem literatūrā tiek aprakstītas, un tiek piedāvātas divas jaunas skaitļu virknes, kuras varētu izmantot, lai uzkonstruētu tādus kvantu automātus.
The Bayesian Pursuit Algorithm: A New Family of Estimator Learning Automata
2011
Published version of a chapter in the book: Modern Approaches in Applied Intelligence. Also available from the publisher at http://dx.doi.org/10.1007/978-3-642-21827-9_53 The fastest Learning Automata (LA) algorithms currently available come from the family of estimator algorithms. The Pursuit algorithm (PST), a pioneering scheme in the estimator family, obtains its superior learning speed by using Maximum Likelihood (ML) estimates to pursue the action currently perceived as being optimal. Recently, a Bayesian LA (BLA) was introduced, and empirical results that demonstrated its advantages over established top performers, including the PST scheme, were reported. The BLA scheme is inherently …
The average state complexity of rational operations on finite languages is linear
2010
Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations are asymptotically linear.
Varieties Generated by Certain Models of Reversible Finite Automata
2006
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.