Finite Automata
Non Determinism of Finite Automata
... basic finite automata model has been extended over the years with different acceptancemodes (nondeterminism, alternation), new or improved devices (two-way heads, Pebbles, nested pebbles) and with ...kindof ...
7
Collaboration Entities on Deterministic Finite Automata
... are finite automaton-based in a collaboration session; in essence, they are just deterministic finite automata in the ...common finite automaton in their respective instantiations, and reach a ...
12
Quantum Digital Signature Scheme Based on Finite Automata
... In 2002, Zeng and Keitel proposed a pioneering arbitrated QDS scheme [2], which can be used to sign both a classical message and a quantum one. This work gave an elementary model to sign a quantum message. In the ...
6
Online Infix Probability Computation for Probabilistic Finite Automata
... Probabilistic finite automata (PFAs) are com- mon statistical language model in natural lan- guage and speech processing. A typical task for PFAs is to compute the probability of all strings that match a ...
6
Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP
... and Automata Package, is the tool which was selected for this ...including finite automata, Mealy and Moore machines, pushdown automata, Turing machines, and their corresponding lan- ...
70
The Equivalent Conversion between Regular Grammar and Finite Automata
... fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids and inspired by the close relationship between the automata theory and the theory of formal ...
5
Distilling weighted finite automata from arbitrary probabilistic models
... Weighted finite automata (WFA) are often used to represent probabilistic models, such as n-gram language models, since they are effi- cient for recognition tasks in time and ...weighted finite ...
11
Active Coevolutionary Learning of Deterministic Finite Automata
... This paper describes an active learning approach to the problem of grammatical inference, specif- ically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the ...
28
Switching and Finite Automata Theory
... Topics in switching and finite automata theory have been an important part of the curriculum in electrical engineering and computer science departments for several decades. The third edition of this book ...
10
Quantum Finite Automata, Quantum Pushdown Automata & Quantum Turing Machine: A Study Tanistha Nayak, Tirtharaj Dash
... quantum finite automata is remarkably more powerful than 1-way quantum finite automata and also can recognise context-free ...quantum finite automata ...quantum finite ...
5
A FINITE AUTOMATA MODEL FOR LAKE EUTROPHICATION
... the changing trophic levels of the lakes by NDFA, using a Prisoner’s Dilemma game is then generated and then.. a DFA from the NDFA is produced.[r] ...
7
One Level Phonology: Autosegmental Representations and Rules as Finite Automata
... "One level phonology: autosegmental representations and rules as finite-state automata." RP 51, University of Edinburgh, Centre for Cognitive Science... '.'Phonological analysis in typed[r] ...
36
Collaboration Entities on Deterministic Finite Automata
... It is viable of this modeling The meaning of this modeling Get a simple, clear, and consistent picture with regard to the collaboration between the entities in a session See through the [r] ...
12
FINITE-AUTOMATA-BASED MODELING OF SPATIAL FLUCTUATIONS OF TRUSS AND BEAM STRUCTURES
... В данной работе предложен универсальный аналитический подход к описанию пространственных колебаний континуальных стрежневых систем на основе теории конечных автоматов, метода начальных п[r] ...
9
Deterministic finite H-Automata and $omega$-regular partial languages
... In [6], Mercas and Manea have extended the concept of partial word to infinite partial word. Regular languages can be represented by deterministic finite automata, non-deterministic finite ...
7
Incremental Construction and Maintenance of Minimal Finite State Automata
... acyclic finite automata have limitations: For instance, if one wants an application to accept all possible integer numbers or Internet addresses, the corresponding finite-state automaton has to be ...
10
Finite Non-Deterministic Automata for FaultDiagnostic in Power Systems
... Finite automata are a useful model for many hardware and software elements. They serve as system models that can be at any moment at a finite number of states, elements that define the current ...
7
Family of lattice valued Aleshin type finite state automata
... type finite automata with membership values in a lattice, which are called lattice-valued Aleshin Type finite ...lattice-valued finite automata is introduced, then the equivalences ...
6
Finite groups as groups of automata with no cycles with exit
... as automata groups. Abelian groups generated by automata over a binary alphabet were considered in ...[5]. Finite automata that generate some finitely presented solvable groups were constructed ...
17
1 Way Multihead Quantum Finite State Automata
... tum finite state automaton introduced by Kondacs and Watrous [2] (measure many quantum finite state auto- ...quantum finite state automaton performs the mea- surement only at the end of ...
18