On decidability and closure properties of language classes with respect to bio-operations
From MaRDI portal
Publication:2311220
DOI10.1007/s11047-015-9500-yzbMath1415.68131MaRDI QIDQ2311220
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
undecidability; decidability; closure properties; counters; pushdown automaton; bio-operations; reversal-bounded
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item