On a Special Case of Unary Regular Language Containment
نویسنده
چکیده
Given an n-state unary finite automaton accepting a language T , and an ultimately periodic set S given as a union of arithmetic progressions that can be represented using n bits, and whose periods are mutually coprime, deciding whether T ⊆ S is in n n) time. Dropping the mutual coprimality condition, this containment problem becomes NP-hard.
منابع مشابه
On Regular Language Factorisation: A Complete Solution for Unary Case
In this paper the problem of regular language decomposition as a concatenation of given regular languages is considered. We prove that the problem is decidable in unary case when all the languages are in single-letter alphabet. This result may be used to give a negative answer in some cases of the general problem.
متن کاملComputing Procedure Summaries for Interprocedural Analysis
We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a backward analysis of procedures, but there are two key new features: (i) information is propagated using “generic” assertions (rather than regular assertions that are used in intraprocedural analysis); and (ii) unification is used...
متن کاملA Similarity Measure for Cyclic Unary Regular Languages
A cyclic unary regular language is a regular language over a unary alphabet that is represented by a cyclic automaton. We propose a similarity measure for cyclic unary regular languages by modifying the Jaccard similarity coefficient and the Sørensen coefficient to measure the level of overlap between such languages. This measure computes the proportion of strings that are shared by two or more...
متن کاملSize of Unary One-Way Multi-head Finite Automata
One of the main topics of descriptional complexity is the question of how the size of the description of a formal language varies when being described by different formalisms. A fundamental result is the exponential trade-off between the number of states of nondeterministic (NFA) and deterministic finite automata (DFA) (see, for example, [12]). Additional exponential and double-exponential trad...
متن کاملComputational Complexity of NFA Minimization for Finite and Unary Languages
We investigate the computational complexity of the nondeterministic finite automaton (NFA) minimization problem for finite and unary regular languages, if the input is specified by a deterministic finite state machine. While the general case of this problem is PSPACEcomplete [13], it becomes theoretically easier when restricted to the aforementioned language families. It is easy to see that in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004