non-deterministic finite automata
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 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
Axelsson, Roland (2010): Verification of Non-Regular Program Properties. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... of non-deterministic finite automata to satisfiability checking of modal logic K – to the purpose of deriving ideas for new algorithms due to the usually rather unintuitive problem formulation ...
167
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
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 ...
7
Non Determinism of Finite Automata
... II. NON DETERMINISTIC FINITE AUTOMATA A nondeterministic finite automaton (NFA), or nondeterministic finite state machine, is a finite state machine that (1) does not ...
7
On Fuzzy Pushdown Automata and their Covering
... fuzzy automata were introduced and studied in [8], few well known, are Automata with weights, L-semi-group automata, Lattice automata, Boolean automata, Semiring automata and ...
7
Efficient Implementation for Deterministic Finite Tree Automata Minimization
... a non-deterministic automata (NFTA). Since the deterministic automata is a particular case of non-deterministic automata, the last approach works well for it and ...
12
Mining Multiple Web Sources Using Non-Deterministic Finite State Automata
... as correct then the recall of OMINI and IPEAD reduce to 38.3% and 29% respectively. In that case the precision value they obtain is that 56% for OMINI and 67% for IEPAD. The authors claim that their approach doesn’t need ...
133
1 Way Multihead Quantum Finite State Automata
... many non-regular context free context sensitive languages accepted by 1QFA(k) other than shown in this ...quantum finite state automaton and L 1DFA 2 ( ) is the set of all languages accepted by 1-way 2-head ...
18
Active Coevolutionary Learning of Deterministic Finite Automata
... of automata that have low observability: these DFAs contain a large number of states, but tend to produce one labelling much more often than the other labelling, for any given ...to non-accepting states, ...
28
Equivalence of Subclasses of Two Way Non Deterministic Watson Crick Automata
... Crick automata are finite automata working on double ...on non deterministic Watson Crick automata and on deterministic Watson Crick ...Crick automata systems have ...
9
Finite Non-Deterministic Automata for FaultDiagnostic in Power Systems
... a non deterministic fi- nite state transducer (NDFST), that is very similar to a FNDA, but with the difference that its function is not to accept strings or languages, but rather transform input strings into ...
7
PAC-learnability of Probabilistic Deterministic Finite State Automata
... The work presented here can be compared to traditional types of PAC learning. Distribution free learning of regular languages has been shown to be hard under some standard cryptographic assumptions (Kearns and Valiant, ...
25
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 in ...
5
Transforming Lattices into Non deterministic Automata with Optional Null Arcs
... A connecting.anode is one whose reflected larcs are a superset of those of the candidate.a-arCs origin This condition assures that all of the lnodes to be reflected as incoming a-arcs of[r] ...
7
Finite State Registered Automata for Non Concatenative Morphology
... For example, combining the Hebrew stem pqd with the circumfix ht-ut will have the 4-level representation shown in Figure 4. Notice that the symbols representing the circumfix in the PR pattern level (i.e., the ...
34
A Novel Approach for the Determination of Membership Values of the Strings in Fuzzy Languages
... classical automata theory deals with discrete space, whereas fuzzy automata theory deals with continuous ...Classical automata cannot manage the fuzziness in system ...the automata theory, and ...
5
Real time QRS complex detection using DFA and regular grammar
... Background: The sequence of Q, R, and S peaks (QRS) complex detection is a crucial procedure in electrocardiogram (ECG) processing and analysis. We propose a novel approach for QRS complex detection based on the ...
20
Advanced Topics on State Complexity of Combined Operations
... Many papers on the state complexities of individual operations have been published since the early 1990’s, for example, [23, 56, 58, 83, 93, 105, 110, 111]. The state complexities of most individual operations such as ...
165