On decidability and closure properties of language classes with respect to bio-operations

DOI10.1007/s11047-015-9500-yzbMath1415.68131OpenAlexW2152204953MaRDI QIDQ2311220

Oscar H. Ibarra

Publication date: 10 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-015-9500-y

zbMATH Keywords

undecidabilitydecidabilityclosure propertiescounterspushdown automatonbio-operationsreversal-bounded

Mathematics Subject Classification ID

Related Items (1)

Closure and nonclosure properties of the classes of compressible and rankable sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of languages defined by ciliate bio-operations
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of decision problems for finite-turn multicounter machines
• Closure and decidability properties of some language classes with respect to ciliate bio-operations.
• Pseudo-inversion on Formal Languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• New Decidability Results Concerning Two-Way Counter Machines
• DNA Codes and Their Properties

This page was built for publication: On decidability and closure properties of language classes with respect to bio-operations