A sufficient condition to polynomially compute a minimum separating DFA
نویسندگان
چکیده
The computation of a minimal separating automaton (MSA) for regular languages has been studied from many different points of view, from synthesis of automata or Grammatical Inference to the minimization of incompletely specified machines or Compositional Verification. In the general case, the problem is NP-complete, but this drawback does not prevent the problem from having a real application in the above-mentioned fields. In this paper, we propose a sufficient condition that guarantees that the computation of the MSA can be carried out with polynomial time complexity. © 2016 Elsevier Inc. All rights reserved.
منابع مشابه
Polynomially bounded solutions of the Loewner differential equation in several complex variables
We determine the form of polynomially bounded solutions to the Loewner differential equation that is satisfied by univalent subordination chains of the form $f(z,t)=e^{int_0^t A(tau){rm d}tau}z+cdots$, where $A:[0,infty]rightarrow L(mathbb{C}^n,mathbb{C}^n)$ is a locally Lebesgue integrable mapping and satisfying the condition $$sup_{sgeq0}int_0^inftyleft|expleft{int_s^t [A(tau)...
متن کاملPolynomial characteristic sets for DFA identification
We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence of data-driven grammatical inference algorithms. In this paper, we prove a sufficient condition that assures the existence of a characteristic sample whose size is polynomial wit...
متن کاملOn the gap between separating words and separating their reversals
A deterministic finite automaton (DFA) separates two strings w and x if it accepts w and rejects x. The minimum number of states required for a DFA to separate w and x is denoted by sep(w, x). The present paper shows that the difference ∣∣sep(w, x)− sep(w, xR)∣∣ is unbounded for a binary alphabet; here w stands for the mirror image of w. This solves an open problem stated in [Demaine, Eisenstat...
متن کاملSeparating Overlapped Intervals on a Line
Given n intervals on a line `, we consider the problem of moving these intervals on ` such that no two intervals overlap and the maximum moving distance of the intervals is minimized. The difficulty for solving the problem lies in determining the order of the intervals in an optimal solution. By interesting observations, we show that it is sufficient to consider at most n “candidate” lists of o...
متن کاملFinding the Smallest Turing Machine Using k log(n) Non-deterministic Guesses
Consider that we are given a number m and two disjoint finite sets of strings A and R. Does there exist a DFA with at most m states that accepts the strings in A and rejects the string in R? We refer to this problem as the inference problem for DFA’s and denote it by INFDFA. It was shown by E. Mark Gold in [4] that INFDFA is NP-hard. To the best of my knowledge, it is not known whether INFDFA r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 370-371 شماره
صفحات -
تاریخ انتشار 2016