Journal ArticleDOI
Insertion languages
David Haussler
- Vol. 31, Iss: 1, pp 77-89
Reads0
Chats0
About:
The article was published on 1983-10-15. It has received 54 citations till now.read more
Citations
More filters
Journal ArticleDOI
On regularity of context-free languages☆
TL;DR: The class of periodic languages is introduced, and it is proved that commutativity of a linear language implies its regularity and a generalization of the Myhill–Nerode characterization of the regular languages in terms of well-quasi orders is given.
Journal Article
Recent Developments on Insertion-Deletion Systems
TL;DR: The origin of these operations, their formal deflnition and a series of results concerning language properties, decidability and computational completeness of families of languages generated by insertion-deletion systems and their extensions with the graphcontrol.
Journal ArticleDOI
Matrix insertion-deletion systems
Ion Petre,Sergey Verlan +1 more
TL;DR: It is shown that in the case of systems that are not computationally complete (with total size equal to 4), the computational completeness can be obtained by introducing the matrix control and using only binary matrices.
Journal ArticleDOI
Graph-Controlled Insertion-Deletion Systems
TL;DR: In this article, the authors consider the operations of insertion and deletion working in a graph-controlled manner and show that computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a contextual or in a context-free manner and with the control graph having only four nodes.
Journal ArticleDOI
Random Context and Semi-conditional Insertion-deletion Systems
Sergiu Ivanov,Sergey Verlan +1 more
TL;DR: In this paper, the authors introduce the operations of insertion and deletion working in random context and semi-conditional modes, and they show that conditional application of insertions and deletions strictly increases the computational power.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book ChapterDOI
Representation of Events in Nerve Nets and Finite Automata
TL;DR: This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.
Book ChapterDOI
The Algebraic Theory of Context-Free Languages*
TL;DR: This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial languages of various kinds.
Journal ArticleDOI
On Theories with a Combinatorial Definition of "Equivalence"
TL;DR: In this article, the authors make a start on a general theory of sets of moves by obtaining some conditions under which the answers to both the above questions are favorable, and the results are essentially about partially-ordered systems, i.e. sets in which there is a transitive relation >, and sufficient conditions are given for every two elements to have a lower bound.
Journal ArticleDOI
A variant of a recursively unsolvable problem
TL;DR: In this article, the correspondence decision problem is defined as the problem of determining for an arbitrary finite set (gu g{), (g2, g2), • • •, (gM, gi) of pairs of corresponding non-null strings on a, b whether there is a solution in w, iu ii, • •• •, in of equation