Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
97
Failure deterministic finite automata
, 2012
"... Abstract. Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for de-riving from a given deterministic fini ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for de-riving from a given deterministic
Partial Derivatives of Regular Expressions and Finite Automata Constructions
- Theoretical Computer Science
, 1995
"... . We introduce a notion of a partial derivative of a regular expression. It is a generalization to the non-deterministic case of the known notion of a derivative invented by Brzozowski. We give a constructive definition of partial derivatives, study their properties, and employ them to develop a new ..."
Abstract
-
Cited by 98 (0 self)
- Add to MetaCart
introduced word derivatives of regular expressions and suggested an elegant algorithm turning a regular expression r into a deterministic finite automata (DFA); the main point of the algorithm is that the word derivatives of r serve as states of the resulting DFA [5]. In the following years derivatives were
Constructing Deterministic Finite-State Automata in Recurrent Neural Networks
- Journal of the ACM
, 1996
"... Recurrent neural networks that are trained to behave like deterministic finite-state automata (DFAs) can show deteriorating performance when tested on long strings. This deteriorating performance can be attributed to the instability of the internal representation of the learned DFA states. The use o ..."
Abstract
-
Cited by 77 (16 self)
- Add to MetaCart
Recurrent neural networks that are trained to behave like deterministic finite-state automata (DFAs) can show deteriorating performance when tested on long strings. This deteriorating performance can be attributed to the instability of the internal representation of the learned DFA states. The use
Hyper-minimisation of deterministic weighted finite automata . . .
"... Hyper-minimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal po ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
power series to differ for finitely many input strings. First, the structure of hyper-minimal deterministic weighted finite automata is characterised in a similar way as in classical weighted minimisation and unweighted hyper-minimisation. Second, an efficient minimisation algorithm, which runs in time
Automata for the assessment of knowledge
- IEEE Transactions on Knowledge and Data Engineering
, 2001
"... AbstractÐThe results of this paper can be applied to construct efficient algorithms for the adaptive assessment of the students' knowledge. The problem of knowledge assessment is a special case of the problem of assessing the state of a system. These results are obtained suggesting a new assess ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
assessment algorithm whose formal equivalence to previously suggested assessment algorithms is proven. A simulation study illustrates the vast improvements of efficiency with the new algorithm. Index TermsÐKnowledge assessment, deterministic finite automaton, knowledge space, knowledge state, assessment
Accepted Manuscript Compression of finite-state automata through failure transitions Compression of finite-state automata through failure transitions
, 2014
"... Please cite this article in press as: H. Björklund et al., Compression of finite-state automata through failure transitions, Theor. Comput. Sci. (2014), http://dx.doi.org/10.1016/j.tcs. 2014.09.007 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service ..."
Abstract
- Add to MetaCart
, and all legal disclaimers that apply to the journal pertain. Compression of finite Abstract Several linear-time algorithms for automata-based pattern matching rely on failure transitions for efficient back-tracking. Like epsilon transitions, failure transition do not consume input symbols, but unlike
Transforming Lattices into Non-deterministic Automata with Optional Null Arcs
"... The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation al-gorithm which tracks, for each node of an automaton under construction, the lares which it reflects and the lattice nodes at their origins and extremities. An extensio ..."
Abstract
- Add to MetaCart
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation al-gorithm which tracks, for each node of an automaton under construction, the lares which it reflects and the lattice nodes at their origins and extremities
Enforcing Operational Properties including Blockfreeness for Deterministic Pushdown Automata
"... Abstract: We present an algorithm which modifies a deterministic pushdown automaton (DPDA) such that (i) the marked language is preserved, (ii) lifelocks are removed, (iii) deadlocks are removed, (iv) all states and edges are accessible, and (v) operational blockfreeness is established (i.e., coacce ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
.e., coaccessibility in the sense that every initial derivation can be continued to a marking configuration). This problem can be trivially solved for deterministic finite automata (DFA) but is not solvable for standard petri net classes. The algorithm is required for an operational extension of the supervisory
Optimistic planning of deterministic systems
- EUROPEAN WORKSHOP ON REINFORCEMENT LEARNING, FRANCE
, 2008
"... If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any sequence of actions. This forms a tree whose size is exponential in the planning time horizon. Here we ask the questio ..."
Abstract
-
Cited by 28 (11 self)
- Add to MetaCart
the question: given finite computational resources (e.g. CPU time), which may not be known ahead of time, what is the best way to explore this tree, such that once all resources have been used, the algorithm would be able to propose an action (or a sequence of actions) whose performance is as close as possible
Incremental Construction and Maintenance of Minimal Finite-State Automata
, 2000
"... this paper, we describe a simple and equally efficient method to modify any minimal finite-state automaton (be it acyclic or not) so that a string is added to or removed from the language accepted by it; both operations are very important when performing dictionary maintenance and solve the dictiona ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
the dictionary construction problem addressed by Daciuk et al. as a special case. The algorithms proposed here are straightforwardly derived from the customary textbook constructions for the intersection and the complementation of finite-state automata. 1 Introduction In a recent paper in this journal, Daciuk
Results 1 - 10
of
97
