Computing by observing: simple systems and simple observers

DOI10.1016/j.tcs.2010.05.040zbMath1207.68184OpenAlexW2040992392MaRDI QIDQ616498

Peter Leupold, Matteo Cavaliere

Publication date: 10 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.040

zbMATH Keywords

complexityobserverautomata theorybehaviornatural computingcomputing by observing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Mutation systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deleting string rewriting systems preserve regularity
• DNA computing, sticker systems, and universality
• McNaughton families of languages.
• The context-splittable normal form for Church-Rosser language systems.
• Evolution and observation -- a non-standard way to generate formal languages
• A hierarchy between context-free and context-sensitive languages
• Computing by Observing: A Brief Survey
• Computing by Only Observing
• Church-Rosser Thue systems and formal languages
• Abstract Interpretation Frameworks
• DNA Computing
• Control sets on grammars
• Associate languages and derivational complexity of formal grammars and languages