Results 1  10
of
32,788
Structure of the minimal automaton of a numeration language, to appear
 in the proceedings of the 12th Descriptional Complexity of Formal Systems. STRUCTURE OF THE MINIMAL AUTOMATON OF A NUMERATION LANGUAGE . . . 13
"... Abstract. We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component and the form of any such additional components. Our characterization ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Under some mild assumptions, we also study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m ≥ 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy
Periodical cicadas: a minimal automaton model
, 2006
"... The origin and evolution of Magicicada spp. life cycles is one of the most intriguing problems in evolutionary biology. These long term periodical life cycles with prime period (namely 13 and 17 years) and the incredibly synchronized emergence of the adults have defied all attempts of ultimate expla ..."
Abstract
 Add to MetaCart
minimal automaton model capable of mimicking those aspects of Magicicada life history. Our results point towards competition between different strains with limited dispersal threshold as the main factor leading to the emergence
The rise of periodical cicadas: a minimal automaton model
, 2006
"... The origin and evolution Magicicada spp. life cycle is one of the most intriguing problems in evolutionary biology. These long term periodical life cycles with prime period (namely 13 and 17 years) and the incredibly synchronized emergence of the adults have defied all attempts of ultimate explanati ..."
Abstract
 Add to MetaCart
minimal automaton model capable of mimicking those aspects of Magicicada life history. Our results points towards competition between different strains with limited dispersal as the main factor leading to the emergence of primenumbered life cycles.
A Minimized Automaton Representation of Reachable States
 Software Tools for Technology Transfer
, 1999
"... We consider the problem of storing a set S ae \Sigma as a deterministic finite automaton (DFA). Weshow that inserting a new string oe 2 \Sigma or deleting a string from the set S represented as a minimized DFA can be done in expected time O(kj\Sigmaj), while preserving the minimality of ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
We consider the problem of storing a set S ae \Sigma as a deterministic finite automaton (DFA). Weshow that inserting a new string oe 2 \Sigma or deleting a string from the set S represented as a minimized DFA can be done in expected time O(kj\Sigmaj), while preserving the minimality
Direct Building of Minimal Automaton for a Given List
"... This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. The size of the temporary automata which are necessary for the construction is less than the size of the resulting minimal automata plus ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. The size of the temporary automata which are necessary for the construction is less than the size of the resulting minimal automata
On building minimal automaton for subset matching queries
"... We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size σ, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) p occurs in the set. That is, we ne ..."
Abstract
 Add to MetaCart
retrieval. Key words: algorithms, approximate string matching, subset matching, finitestate automaton minimization 1.
Building the Minimal Automaton of A ∗ X in Linear Time, When X Is of Bounded Cardinality
"... Abstract. We present an algorithm for constructing the minimal automaton recognizing A ∗ X, where the pattern X is a set of m (that is a fixed integer) nonempty words over a finite alphabet A whose sum of lengths is n. This algorithm, based on Brzozowski’s minimization algorithm, uses sparse lists ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We present an algorithm for constructing the minimal automaton recognizing A ∗ X, where the pattern X is a set of m (that is a fixed integer) nonempty words over a finite alphabet A whose sum of lengths is n. This algorithm, based on Brzozowski’s minimization algorithm, uses sparse lists
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
& Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces counterexamples of minimal length. We introduce a bounded model checking procedure for LTL
Inducing Features of Random Fields
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract

Cited by 664 (14 self)
 Add to MetaCart
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing
Results 1  10
of
32,788