Results 1  10
of
167
A Taxonomy of Finite Automata Minimization Algorithms
, 1993
"... This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant minimization algorithm differs from all other known minimization algorithms, and is derived separately. All of the remaining algorithms depend upon computing an equivalence relation on states. We def ..."
Abstract

Cited by 35 (6 self)
 Add to MetaCart
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant minimization algorithm differs from all other known minimization algorithms, and is derived separately. All of the remaining algorithms depend upon computing an equivalence relation on states. We
Minimizing local automata
"... Abstract — We design an algorithm that minimizes irreducible deterministic local automata by a sequence of state mergings. Two states can be merged if they have exactly the same outputs. The running time of the algorithm is O(min(m(n −r +1), m log n)), where m is the number of edges, n the number of ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract — We design an algorithm that minimizes irreducible deterministic local automata by a sequence of state mergings. Two states can be merged if they have exactly the same outputs. The running time of the algorithm is O(min(m(n −r +1), m log n)), where m is the number of edges, n the number
Enumeration and Generation of . . . Deterministic Finite Automata
, 2010
"... The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initiallyconnected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we gi ..."
Abstract
 Add to MetaCart
The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initiallyconnected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we
Enumeration and Generation of Initially Connected Deterministic Finite Automata ∗
"... The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initiallyconnected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initiallyconnected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we
An Implementation of Three Algorithms for Timing Verification Based on Automata Emptiness
, 1992
"... This papers describes modifications to and the implementation of algorithms previously described in [1, 11]. We first describe three generic (untimed) algorithms for constructing graphs of the reachable states of a system, and how these graphs can be used for verification. They all have as input an ..."
Abstract

Cited by 62 (3 self)
 Add to MetaCart
an implicit description of a transition system. We then apply these algorithms to realtime systems. The first algorithm performs a straightforward reachability analysis on sets of states of the system, rather than on individual states. This corresponds to stepping symbolically through the system many states
Extending Finite Automata to Efficiently Match PerlCompatible Regular Expressions
"... Regular expression matching is a crucial task in several networking applications. Current implementations are based on one of two types of finite state machines. Nondeterministic finite automata (NFAs) have minimal storage demand but have high memory bandwidth requirements. Deterministic finite aut ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Regular expression matching is a crucial task in several networking applications. Current implementations are based on one of two types of finite state machines. Nondeterministic finite automata (NFAs) have minimal storage demand but have high memory bandwidth requirements. Deterministic finite
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
"... Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchicalstructured componentoriented software systems. However, the rules governing composition, as is typical for all automatabased approaches, suffer from combinatorial state explosion, an e ..."
Abstract
 Add to MetaCart
, an effect that can have significant ramifications on the successful application of the Component Interaction Automata formalism to realworld scenarios. We must, therefore, find some appropriate means to counteract state explosion – one of which is partition refinement through weak bisimulation. But, while
Multimodel Control of Continuous Processes through State Space Phase Partitioning
"... The dynamics of systems are qualitatively characterized by phase transitions over system state spaces. We develop a methodology where a state space is partitioned and then partitions are lumped into phases which are combined to form finite state automata controllers of the underlying continuous syst ..."
Abstract
 Add to MetaCart
The dynamics of systems are qualitatively characterized by phase transitions over system state spaces. We develop a methodology where a state space is partitioned and then partitions are lumped into phases which are combined to form finite state automata controllers of the underlying continuous
A Synthesis on Partition Refinement: a useful Routine for Strings, Graphs, Boolean Matrices and Automata
 In Proc. Fifteenth STACS
, 1998
"... Partition refinement techniques are used in many algorithms. This tool allows efficient computation of equivalence relations and is somehow dual to unionfind algorithms. The goal of this paper is to propose a single routine to quickly implement all these already known algorithms and to solve a ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
of states of a deterministic finite automaton. Spinrad [15] investigated the graph partitioning ...
GEOMETRIC BROADCASTING AUTOMATA Geometric Computations by Broadcasting Automata on the Integer Grid
"... In this paper we introduce and apply a novel approach for selforganiz ation, partitioning and pattern formation on the nonoriented grid environment. The method is based on the generation of nodal patterns in the environment via sequences of discrete waves. The power of the primitives is illustrat ..."
Abstract
 Add to MetaCart
is illustrated by giving solutions to two geometric problems using the broadcast automata model arranged in an integer grid (a square lattice) formation. In this model automata cannot directly observe their neighbours ’ state and can only communicate with neighbouring automata through the nonoriented broadcast
Results 1  10
of
167