Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages

DOI10.1007/978-3-319-21819-9_12zbMath1465.68082OpenAlexW2253940065MaRDI QIDQ2945564

Sergiu Ivanov, Rudolf Freund, Ludwig Staiger

Publication date: 14 September 2015

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21819-9_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Variants of P systems with activation and blocking of rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation as an unbounded process
• Finite-state \(\omega\)-languages
• Computing with membranes
• Membrane computing. An introduction.
• A formalization of membrane systems with dynamically evolving structures
• A note on accelerated Turing machines
• A Bioinspired Computing Approach to Model Complex Systems
• Red–Green P Automata
• On ω-regular sets
• Membrane Computing
• P Systems with Anti-Matter
• Membrane Computing

This page was built for publication: Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages