Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
TLDR
Very simple languages are introduced which play the same role for the class of recursively enumerable languages that the Dyck languages play for theclass of context-free languages.Abstract:
Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these classes of languages are proved, and it is shown how to use them to represent recursively enumerable sets. In particular, very simple languages are introduced which play the same role for the class of recursively enumerable languages that the Dyck languages play for the class of context-free languages. Finally, a new type of acceptor for defining equality languages is introduced. KEY WOADS AND PHRASES: equality language, fLxed point language, recursively enumerable language, determin- istic sequential machine, Turing machine, Post correspondence problem, shuffle, AFL generator, representation of languagesread more
Citations
More filters
Graph Rewriting: An Algebraic and Logic Approach.
TL;DR: This chapter presents three mathematical tools that can be used to describe graph-grammars and the sets generated by them, and presents the use of category theory for specifying graph rewriting rules in a precise and concise way.
Book ChapterDOI
Graph rewriting: an algebraic and logic approach
TL;DR: In this paper, the authors present three mathematical tools that can be used to describe graph-grammars and the sets generated by them and compare the powers of several logical languages.
Journal Article
On String Languages Generated by Spiking Neural P Systems
TL;DR: In this paper, the authors consider spiking neural P systems as binary string generators, where the set of spike trains of halting computations of a given system constitutes the language generated by that system.
Journal ArticleDOI
The (generalized) post correspondence problem with lists consisting of two words is decidable
Journal ArticleDOI
Topics in the theory of DNA computing
TL;DR: The theoretical developments of DNA computing are demonstrated by discussing a number of selected topics and an introduction to the basic structure of DNA and the basic DNA processing tools is given.
References
More filters
Book
Computation: Finite and Infinite Machines
TL;DR: In this article, the authors present an abstract theory that categorically and systematically describes what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment, and the abstract theory tells us in no uncertain terms that the machines' potential range is enormous and that its theoretical limitations are of the subtlest and most elusive sort.
Journal ArticleDOI
Indexed Grammars—An Extension of Context-Free Grammars
TL;DR: A new type of grammar for generating formal languages, called an indexed grammar, is presented, and the class of languages generated by indexed grammars has closure properties and decidability results similar to those for context-free languages.
Journal ArticleDOI
Transductions des langages de Chomsky
TL;DR: Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale, toute copie ou impressions de ce fichier doit contenir la présente mention de copyright.