deterministic finite-state automata
PAC-learnability of Probabilistic Deterministic Finite State Automata
... Probabilistic Deterministic Finite State Automata (PDFAs) are widely used in a number of differ- ent fields, including Natural Language Processing (NLP), Speech Recognition (Mohri, 1997) and ...
25
Mining Multiple Web Sources Using Non-Deterministic Finite State Automata
... into deterministic finite automata (DFA), our algorithm handles ambiguity and epsilon () transition and able to identify different tuples from list of ...
133
Vol 3, No 3 (2012)
... of deterministic finite state automata (DFSA) and the conversion of a non deterministic finite state automata (NDFSA) to an equivalent DFSA play an important role ...
5
Active Coevolutionary Learning of Deterministic Finite Automata
... evidence-driven state merging algorithms (EDSMs) (Trakhtenbrot and Barzdin, 1973; Lang et ...that state merging tends to increase the test set accuracy of the reduced ...
28
Methods of Regular Expression
... into finite automata and vice versa motivates research into some alternative so that time taken for above is ...of deterministic finite automata to regular expression, several ...
7
Algorithm Design and String Recognition for Suffix Strings Using Deterministic Finite Automata
... recognizer. Finite Automata is used to check the acceptance of Regular ...Languages. Finite Automata is a machine consisting of set of states whose controls moves in response to external ...
8
Finite Non-Deterministic Automata for FaultDiagnostic in Power Systems
... Another important characteristic that was added to this version is the ability to deal with possibly spurious alarms. If an alarm is not followed by the ones expected in this fault, it probably was generated spuriously, ...
7
Multidisciplinary insight into clonal expansion of HTLV-1–infected cells in adult T-cell leukemia via modeling by deterministic finite automata coupled with high-throughput sequencing
... AC state to the malignant states of smol- dering (SM), chronic, or acute ATL [22 – 24], monitoring clonal expansion via an accurate method of detection is of great clinical importance [8, ...
12
Collaboration Entities on Deterministic Finite Automata
... The difference between a DFA and an NFA is that, for a DFA, it is in a single state at any time, while for an NFA, it has the power to be in multiple states at a time. NFA is more succinct and easier to design, ...
12
A Novel approach for Construction of Deterministic Finite Automata Using 3-D Model
... input. Automata theory is a subpart of theory of computation which deals with logic of computation with respect to simple machines also known as ...these automata we are to able to understand how a machine ...
12
1 Way Multihead Quantum Finite State Automata
... quantum finite state automaton and L 1DFA 2 ( ) is the set of all languages accepted by 1-way 2-head deterministic finite state ...
18
Count based state merging for probabilistic regular tree grammars
... More generally, finding a grammar by exam- ining terminal objects is one of the problems in- vestigated in the field of grammatical inference. There are many results for the string case, e.g., on how to learn ...
7
Count based State Merging for Probabilistic Regular Tree Grammars
... More generally, finding a grammar by exam- ining terminal objects is one of the problems in- vestigated in the field of grammatical inference. There are many results for the string case, e.g., on how to learn ...
7
Vol 9, No 2 (2018)
... fuzzy automata monads have some results on, what may be called, separated, connected, strongly connected and retrievable intuitionistic fuzzy automata ...
6
Multi threaded composition of finite state automata
... The most common serial algorithm (Mohri, 2009) for computing the composition of two WF- STs is presented here as Algorithm 1, and can be considered a variant of the standard intersection algorithm for unweighted FSAs as ...
9
Revisiting timed logics with automata modalities
... add automata modalities into LTL at no additional computational cost [46, ...time-constrained automata modalities defined by non- deterministic finite automata ( NFA s) is called ...
12
A model of rainfall based on finite state cellular automata
... The purpose of this paper is to demonstrate that a finite state cellular automata model is suitable for modeling rainfall in the space-time plane. The time-series properties of the simulated series ...
12
Adaptive Importance Sampling from Finite State Automata
... Li and Eisner (2009) give an exact semiring so- lution if two key assumptions can be made. First the definition of the probability G(T ) must de- compose into smaller derivation steps along the rules of A. Second the ...
10
String Kernels, Fisher Kernels and Finite State Automata
... Furthermore, this view also suggests extending consideration to subsequences of varying lengths in the same model. This leads to a Finite State Automaton again inferred from the data. The refined ...
8
On congruences of automata defined by directed graphs
... of the original graph labeling. Our paper contributes to this direction and con- tinues the investigation initiated in [5], where the concept of a graph algebra has been used in order to define finite state ...
16