Language equations, maximality and error-detection
Lila Kari,Stavros Konstantinidis +1 more
Reads0
Chats0
TLDR
This work considers a certain type of language inequations involving language operations and observes that, by varying the parameters of such an inequation, it can define families of codes such as prefix and infix, as well as families of error-detecting languages.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2005-02-01 and is currently open access. It has received 21 citations till now. The article focuses on the topics: Context-sensitive language & Inequation.read more
Citations
More filters
Journal ArticleDOI
On properties of bond-free DNA languages
TL;DR: A list of known properties of DNA languages which are free of certain types of undesirable bonds is recalled and a general framework in which each of these properties is characterized by a solution of a uniform formal language inequation is introduced.
Journal ArticleDOI
Decision problems for language equations
TL;DR: The families of languages defined by components of unique, least and greatest solutions of such systems are shown to coincide with the classes of recursive, recursively enumerable and co-recursive enumerable sets, respectively.
Journal Article
Bond-free languages : Formalizations, maximality and construction methods
TL;DR: In this article, the problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations.
Journal ArticleDOI
Aspects of shuffle and deletion on trajectories
Lila Kari,Petr Sosík +1 more
TL;DR: This work characterize the class of binary word operations for which the validity of such a language equation is (un)decidable, for regular and context-free operands, and focuses on three standard decision problems concerning linear language equations with one variable involving these operations.
Journal ArticleDOI
Bond-free languages: formalizations, maximality and construction methods
TL;DR: The property of sim-bond-freedom, where aim is a similarity relation between words, is defined and it is shown that this property is decidable for context-free languages and polynomial-time decidablefor regular languages.
References
More filters
BookDOI
Handbook of Formal Languages
Grzegorz Rozenberg,Arto Salomaa +1 more
TL;DR: This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field.
Book
Regular languages
TL;DR: The class of regular sets is the smallest class of sets containing the finite sets which is closed under union, concatenation, and Kleene closure as discussed by the authors, and it is shown that any finite set can be easily generated by a regular grammar.