Filters








60,501 Hits in 3.2 sec

Applications of Symbolic Finite Automata [chapter]

Margus Veanes
2013 Lecture Notes in Computer Science  
We show how symbolic finite automata enable applications ranging from modern regex analysis to advanced web security analysis, that were out of reach with prior methods.  ...  In our approach we use state-of-the-art constraint solving techniques for automata analysis that are both expressive and efficient, even for very large and infinite alphabets.  ...  5] and extended finite automata [12] .  ... 
doi:10.1007/978-3-642-39274-0_3 fatcat:zzu2qiguyjgp3jwzfydy2cszkq

Finite-State Automata on Infinite Inputs [chapter]

Madhavan Mukund
2012 Modern Applications of Automata Theory  
This paper is a self-contained introduction to the theory of finite-state automata on infinite words.  ...  In recent years, there has been renewed interest in these automata because of the fundamental role they play in the automatic verification of finite-state systems.  ...  We begin by eliminating nested applications of the successor function.  ... 
doi:10.1142/9789814271059_0002 fatcat:szrc6hqrenb2nayoqnh52fqib4

Finite Automata and the Analysis of Infinite Transition Systems [chapter]

Wolfgang Thomas
2012 Modern Applications of Automata Theory  
A Language-Theoretic View of Verification 149 Kamal Lodaya 6.  ...  Finite-State Automata on Infinite Inputs 45 Madhavan Mukund 3. Basics on Tree Automata 79 Christof Lading 4. Part II: Verification 5.  ... 
doi:10.1142/9789814271059_0016 fatcat:qia5zo73evbj7c24fwl76d6z64

An Introduction to Finite Automata and their Connection to Logic [chapter]

Howard Straubing, Pascal Weil
2012 Modern Applications of Automata Theory  
This introductory chapter is a tutorial on finite automata.  ...  We conclude with an introduction to the syntactic monoid, and as an application give a proof of the equivalence of first-order definability and aperiodicity.  ...  In Section 1. 4 we prove what might well be described as the two fundamental theorems of finite automata: that the languages recognized by finite automata are exactly those definable by sentences of  ... 
doi:10.1142/9789814271059_0001 fatcat:je7x3a67kbctnpkee7s3tgnx2u

Automata finiteness criterion in terms of van der Put series of automata functions

V. Anashin
2012 P-Adic Numbers, Ultrametric Analysis, and Applications  
In the paper we prove a criterion for finiteness of the number of states of automaton in terms of van der Put series of the automaton function.  ...  In the paper we develop the p-adic theory of discrete automata.  ...  For application of the non-Archimedean methods to automata and formal languages see expository paper [10] and references therein; for applications to automata and group theory see [6, 5] .  ... 
doi:10.1134/s2070046612020070 fatcat:zjuqh32un5fzxj2s7eollr4hay

Conversion of Finite Automata to Fuzzy Automata for string comparison

Dr. V.Ramaswamy, H. A. Girijamma
2012 International Journal of Computer Applications  
In this paper, a method has been presented to convert finite automaton to fuzzy automaton as fuzzy automaton is better than finite automaton for strings comparison when individual levels of similarity  ...  for particular pairs of symbols or sequences of symbols are defined.  ...  Fuzzy automata are more useful in performing comparison operations unlike finite automata which cannot decide how close two given strings are.  ... 
doi:10.5120/4625-6647 fatcat:htwriovmo5eefnot67vfvco3jq

On the state complexity of semi-quantum finite automata

Shenggen Zheng, Jozef Gruska, Daowen Qiu
2014 RAIRO - Theoretical Informatics and Applications  
Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical  ...  finite automata Amb98,Amb09,AmYa11,Ber05,Fre09,Mer00,Mer01,Mer02,Yak10,ZhgQiu112,Zhg12.  ...  The first and second authors acknowledge support of the Employment of Newly Graduated Doctors of Science for Scientific Ex-  ... 
doi:10.1051/ita/2014003 fatcat:jeiucakqfrdpdgccxfd7oxledy

Application of Pseudo-Memory Finite Automata for Information Encryption

Gulmira Shakhmetova, Zhanat Saukhanova, Nur Izura Udzir, Altynbek Sharipbay, Nurgazy Saukhanov
2021 International Workshop on Intelligent Information Technologies & Systems of Information Security  
For a better understanding of the application of this type of finite automata in cryptography, the authors demonstrated an example of their application for encryption and decryption of information.  ...  According to the research carried out, it can be noted that in existing cryptosystems, finite automata of various types are used: finite automata of a general form, structural automata, finite automata  ...  of the invertibility of finite automata.  ... 
dblp:conf/intelitsis/ShakhmetovaSUSS21 fatcat:joapqn4nbfeqjfntcwtcc7nd6a

Corrigendum to "Another approach to the equivalence of measure-many one-way quantum infinite automata and its application" [J. Comput. Syst. Sci. 78 (3) (2012) 807–821]

Tianrong Lin
2015 Journal of computer and system sciences (Print)  
As an application of the approach, we utilize it to address the equivalence problem of Enhanced one-way quantum finite automata (E-1QFAs) introduced by Nayak [Proceedings of the 40th Annual IEEE Symposium  ...  In this paper, we present a much simpler, direct and elegant approach to the equivalence problem of measure many one-way quantum finite automata (MM-1QFAs).  ...  quality and the presentation of this paper.  ... 
doi:10.1016/j.jcss.2015.02.002 fatcat:7offtylohfhudl377ljr64j4ea

Sampling from Stochastic Finite Automata with Applications to CTC Decoding

Martin Jansche, Alexander Gutkin
2019 Interspeech 2019  
We show that path-sampling is effective and can be efficient if the epsilon-graph of a finite automaton is acyclic.  ...  Stochastic finite automata arise naturally in many language and speech processing tasks. They include stochastic acceptors, which represent certain probability distributions over random strings.  ...  Foundations Stochastic finite automata are used in many language and speech processing tasks, including speech recognition [1, 2] and synthesis [3, 4] , language [5] and pronunciation [6] modeling  ... 
doi:10.21437/interspeech.2019-2740 dblp:conf/interspeech/JanscheG19 fatcat:ycszvdvshjaufm5adnkrv22udi

Communication complexity of promise problems and their applications to finite automata [article]

Jozef Gruska, Daowen Qiu, Shenggen Zheng
2013 arXiv   pre-print
of an equivalent one-way deterministic finite automata (1DFA).  ...  Klauck [Kla00] proved, for any language, that the state complexity of exact quantum/classical finite automata, which is a general model of one-way quantum finite automata, is not less than the state complexity  ...  Number of states is a natural complexity measure for all models of finite automata and state complexity of finite automata is one of the important research fields with many applications [20] .  ... 
arXiv:1309.7739v1 fatcat:2ivte4f4vvf5tocfd5fj6fyb3e

An application of quantum finite automata to interactive proof systems

Harumichi Nishimura, Tomoyuki Yamakami
2009 Journal of computer and system sciences (Print)  
Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space.  ...  We demonstrate strengths and weaknesses of our systems and further study how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems.  ...  The first author is grateful to Hirotada Kobayashi for a detailed presentation of his result.  ... 
doi:10.1016/j.jcss.2008.12.001 fatcat:oz7dnccj4jgvnkh2wsutwahsde

Arithmetic coding of weighted finite automata

J. Kari, P. Fränti
1994 RAIRO - Theoretical Informatics and Applications  
PRELEMINARIES Weighted Finite Automata (WFA) are finite automata with each edge labeled besides an input symbol also by a real number.  ...  INTRODUCTION The image compression based on Weighted Finite Automata (WFA) is a relatively efficient fractal compression method that gives good compression results.  ... 
doi:10.1051/ita/1994283-403431 fatcat:cqd3zrlo3vf3vg4fg3kebvhdwa

Rulebased Knowledge Representation Inspired from Finite Automata

Nabil M. Hewahi
2011 International Journal of Computer Applications  
The proposed approach is inspired from Finite Automata (FA). The inspired FA diagrams are easily used to represent rule-based system and make it more reliable structure in large complicated systems.  ...  of inputs are considered.  ...  Finite Automata Finite automata or called deterministic finite automata is a diagrammatic representation of languages, it consists of the following components [2] : a.  ... 
doi:10.5120/2493-3367 fatcat:ys7lhojb7bdt5hwqxk2pvbrk5e

Adaptive E-learning using Deterministic Finite Automata

Pratima Sarkar, Chinmoy Kar
2014 International Journal of Computer Applications  
Adaptive E-learning refers to adapt the way of presentation of educational material according to the student's needs.  ...  For implementing E-learning this paper uses Deterministic Finite Automata (DFA) it helps in adaptive learning.  ...  Deterministic Finite Automata has a fixed number of states and student can only be in one state at a time. In DFA transition of the states depends upon input and state.  ... 
doi:10.5120/17130-7712 fatcat:y6n32dvufnfnhbdtdh5jpaa4na
« Previous Showing results 1 — 15 out of 60,501 results