On the dissimilarity operation on finite languages
Nelma Moreira2016
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
The distinguishability language of a regular language L is the set of words distinguishing between pairs of words under the Myhill-Nerode equivalence induced by L, i.e., between pairs of distinct left quotients of L. The similarity relation induced by a language L is a similarity relation inspired by the Myhill-Nerode equivalence and it was used to obtain compact representation of automata for a finite language L, i.e., deterministic finite cover automata, which are deterministic finite automata accepting all the words of L and possibly some other words that are longer than any word of L. The dissimilarity language of a finite language L is defined as the set of words that separate a pair of words which are not similar w.r.t. to a (finite) language L. In this paper we extend the study of distinguishability operation on regular languages to l-dissimilarity, for l ∈ N, and the dissimilarity operation on finite languages. We examine their properties, the state complexity, and relations...
Related papers
The Distinguishability Operation On Regular Languages
In this paper we study the language of the words that, for a given language L, distinguish between pairs of different left-quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. We give an upper bound for the state complexity of the distinguishability, and prove its tightness. We show that the set of minimal words that can be used to distinguish between different quotients of a language L has at most n − 1 elements, where n is the state complexity of L, and we also study the properties of its iteration.
Distinguishability Operations and Closures on Regular Languages
arXiv (Cornell University), 2014
Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. We give an upper bound for the state complexity of the distinguishability operation, and prove its tightness. We show that the set of minimal words that can be used to distinguish between different left-quotients of a language $L$ has at most $n-1$ elements, where $n$ is the state complexity of $L$, and we also study the properties of its iteration. We generalize the results for the languages of words that distinguish between pairs of different right-quotients and two-sided quotients of a language $L$.
An Approximate Method for Calculating the Distance Between Regular Languages for Multitape Finite Automata
Mathematical Problems of Computer Science, 2020
Sets of word tuples, accepted by multitape finite automata and a metric space for languages accepted by these automata, are considered. These languages are represented using the same notation as the known notation of regular expressions for languages accepted by one-tape automata. The only difference is the interpretation of the ”concatenation” operation in the notation. An algorithm is proposed for calculating the introduced distance between regular languages accepted by multitape finite automata.
Descriptional and computational complexity of finite automata—A survey
Information and Computation, 2011
Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages. Over the last half century, a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept has been developed. In the present paper, we tour a fragment of this literature. Mostly, we discuss developments relevant to finite automata related problems like, for example, (i) simulation of and by several types of finite automata, (ii) standard automata problems such as fixed and general membership, emptiness, universality, equivalence, and related problems, and (iii) minimization and approximation. We thus come across descriptional and computational complexity issues of finite automata. We do not prove these results but we merely draw attention to the big picture and some of the main ideas involved.
Distinguishability Operations and Closures
Fundamenta Informaticae, 2016
Given a language L, we study the language of words D(L), that distinguish between pairs of different left quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. For the case of regular languages, we give an upper bound for the state complexity of the distinguishability operation, and prove its tightness. We show that the set of minimal words that can be used to distinguish between different left quotients of a regular language L has at most n − 1 elements, where n is the state complexity of L, and we also study the properties of its iteration. We generalize the results for the languages of words that distinguish between pairs of different right quotients and two-sided quotients of a language L.
Testing the Equivalence of Regular Languages
Electronic Proceedings in Theoretical Computer Science, 2009
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic finite automata that avoids minimisation. In this paper we improve the best-case running time, present an extension of this algorithm to non-deterministic finite automaton, and establish a relationship between this algorithm and the one proposed in Almeida et al. We also present some experimental comparative results. All these algorithms are closely related with the recent coalgebraic approach to automata proposed by Rutten.
A New Algorithm for Determining the Equivalence of Two Finite-State Automata
Journal of Advances in Mathematics and Computer Science, 2018
Finite-state automaton is a machine that processes input strings and produces output indicating whether the input string is accepted or not. It is an acceptor recognizer for input specification. A finite-state automaton is an input/output device that accepts strings as input and produces binary numbers 0s and 1s. Two automata are equivalent if they generate the same or similar output for each input string. That is to say, two automata are equivalent if and only if they have the same computing powers. In this paper, we develop an algorithm that can be used to determine if two automata are equivalent. Such automaton could be an non-deterministic finite automata (NFA) that is converted to deterministic finite automata (DFA) or a DFA that is minimized into another DFA (minimized DFA) which are equivalent in the sense that they have the same computing power and can therefore be used to compute the same regular expression. Examples of the use of the algorithms are provided and their results show that they are equivalent in all respects. From the examples, it is clearly seen that each pair of automaton accept the same language, hence they are said to be equivalent. The proposed algorithm performs better in terms of time and space complexities when compared with existing algorithms because it runs faster and occupies less space in the computer's memory.
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences, 1976
We consider the complexity of the equivalence and containment problems for regular expressions and context-free grammars, concentrating on the relationship between complexity and various language properties. Finiteness and boundedness of languages are shown to play important roles in the complexity of these problems. An encoding into grammars of Turing machine computations exponential in the size of the grammar is used to prove several exponential lower bounds. These lower bounds include exponential time for testing equivalence of grammars generating finite sets, and exponential space for testing equivalence of non-self-embedding grammars. Several problems which might be complex because of this encoding are shown to simplify for linear grammars. Other problems considered include grammatical covering and structural equivalence for right-linear, linear, and arbitrary grammars.
On the Representation of Finite Automata
Computing Research Repository, 2009
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFA's) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its enumeration provides an alternative way to obtain the exact number of ICDFA's. * Work partially funded by Fundação para a Ciência e Tecnologia (FCT) and Program POSI.
On the representation of finite deterministic 2-tape automata
Theoretical Computer Science, 1999
This paper presents properties of relations between words that are realized by defermini.svtic finite 2-tape automata. It has been made as complete as possible, and is structured by the systematic use of the matrix representation of automata. It is first shown that deterministic 2-tape automata are characterized as those which can be given a prefix matrix representation. Sc~~tzenberger construct on representations, the one that gives semi-monomial represen~tions for rational functions of words, is then applied to this prefix representation in order to obtain a new proof of the fact that the lexicographic selection of a deterministic rational relation on words is a rational function.
The equivalence problem for regular expressions over one letter is elementary
15th Annual Symposium on Switching and Automata Theory (swat 1974), 1974
There are a few notations for standard concepts which differ according to which author one reads. We use the following notation in these problems. • The complement of set S is denoted S. The difference between sets X and Y is denoted X -Y . • The empty string is denoted λ. (Some authors use ε, some authors use λ.) • The reversal of a string w is denoted w R . Contents 1 Strings, languages, regular expressions 2 Context-free grammars and languages 3 Ambiguity 4 Normal forms for CFGs. 5 Closure properties of context-free languages 6 Pushdown automata and parsing. 7 Proving languages not context-free 8 Decision problems for CFGs 9 Finite Automata 10 Proving languages not regular 11 Closure properties of regular languages 12 Decision problems about regular languages 13 The Myhill-Nerode theorem and minimization of automata 14 Turing machines 15 Undecidability
Automata and differentiable words
2012
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this construction to the case of C ∞ -words, i.e., words differentiable arbitrary many times. We thus obtain an infinite automaton for representing the set of C ∞ -words. We derive a classification of C ∞words induced by the structure of the automaton. Then, we introduce a new framework for dealing with C ∞ -words, based on a three letter alphabet. This allows us to define a compacted version of the automaton, that we use to prove that every C ∞ -word admits a repetition in C ∞ whose length is polynomially bounded.
Properties and Complexity of Deterministic State-Partition Automata
A deterministic finite automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic finite automaton accepting the projected language P(L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a linear algorithm to decide whether an automaton is a state-partition automaton with respect to a given projection, a construction of the minimal state-partition automaton, discuss closure properties of state-partition automata under the standard constructions of deterministic finite automata for regular operations, and show that almost all of them fail to preserve the property of being a state-partition automaton. Finally, we define the notion of state-partition complexity, and prove the tight bound on state-partition complexity of regular languages represented by incomplete deterministic finite automata.
On properties and state complexity of deterministic state-partition automata
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P (L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a construction of the minimal state-partition automaton for a regular language and a projection, discuss closure properties of state-partition automata under the standard constructions of deterministic automata for regular operations, and show that almost all of them fail to preserve the property of being a statepartition automaton. Finally, we define the notion of a state-partition complexity, and prove the tight bound on the state-partition complexity of regular languages represented by incomplete deterministic automata.
T.: Efficient separability of regular languages by subsequences and suffixes
2013
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise-and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata. 1
On the Transition Reduction Problem for Finite Automata
Fundamenta Informaticae, 2014
We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language L(En) denoted by the regular expres- These results can be used in the general case of the transition reduction problem.
On equations for regular languages, finite automata, and sequential networks
Theoretical Computer Science, 1980
We consider systems of equations of the form Xi=,IJ,a l &~LJ& i=l,...,n where A is the underlying alphabet, the Xi are variables, the Pi.0 are boolean functions in the variables J&B and each & is either the empty word or the empty set. The symbolsand u denote
Related topics
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.