On Decidability and Closure Properties of Language Classes with Respect to Bio-operations
Author:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 148-160
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Pseudo-inversion on Formal Languages2014
- Model Checking Recursive Programs with Numeric Data Types2011
- DNA Codes and Their PropertiesLecture Notes in Computer Science, 2006
- Involution codes: with application to DNA coded languagesNatural Computing, 2005
- Families of languages defined by ciliate bio-operationsTheoretical Computer Science, 2004
- Closure and decidability properties of some language classes with respect to ciliate bio-operationsTheoretical Computer Science, 2003
- New Decidability Results Concerning Two-Way Counter MachinesSIAM Journal on Computing, 1995
- The complexity of decision problems for finite-turn multicounter machinesJournal of Computer and System Sciences, 1981
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961