Journal ArticleDOI
State Reduction in Incompletely Specified Finite-State Machines
TLDR
Two reduction techniques–state assignment to the DON'T CARE entries, and so-called "state splitting"–are investigated, and the question, "Can I achieve an equivalent k state machine?" is shown to bePolynomial complete, with the resulting conjecture that neither is solvable in time bounded by a polynomial function of the size of the machine.Abstract:
The problem of reducing the number of states in an arbitrary incompletely specified deterministic finite-state machine to k states (for a given k) has proven intractible to solution within "reasonable" time; most techniques seem to require exponential time. Two reduction techniques–state assignment to the DON'T CARE entries, and so-called "state splitting"–are investigated. For both of the techniques, the question, "Can I achieve an equivalent k state machine?" is shown to be polynomial complete, with the resulting conjecture that neither is solvable in time bounded by a polynomial function of the size of the machine.read more
Citations
More filters
Journal ArticleDOI
The control of discrete event systems
Peter J. Ramadge,W. M. Wonham +1 more
TL;DR: The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered.
Journal ArticleDOI
Space-bounded reducibility among combinatorial problems
TL;DR: Two versions of the polynomial time-reducibility of Cook and Karp are defined, by means of Turing machines and by bounded-quantifier formulas, and they are shown to be complete for nondeterministic (deterministic) log n space.
Journal ArticleDOI
On the complexity of minimum inference of regular sets
TL;DR: Results concerning the computational tractability of some problems related to determining minimum realizations of finite samples of regular sets by finite automata and regular expressions are proved.
Journal ArticleDOI
On the control of discrete-event dynamical systems
TL;DR: In this article, a class of problems related to the supervisory control of a discrete-event system (DES), as formulated by Ramadge and Wonham, was studied, focusing on the computational effort required for their solution.
Proceedings ArticleDOI
Inference and analysis of formal models of botnet command and control protocols
TL;DR: A novel approach to infer protocol state machines in the realistic high-latency network setting and applies it to the analysis of botnet Command and Control protocols, enabling an order of magnitude reduction in the number of queries and time needed to learn a botnet C &C protocol.
References
More filters
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Book
Switching and Finite Automata Theory
Zvi Kohavi,Niraj K. Jha +1 more
TL;DR: Theories are made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
Journal ArticleDOI
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
M. C. Paull,S. H. Unger +1 more
TL;DR: A partially enumerative solution to the problem of reducing the number of rows in a flow table in which some of the entries are unspecified is presented and a rough indication of the efficiency of the given procedures is obtained.
Related Papers (5)
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
M. C. Paull,S. H. Unger +1 more