Can abstract state machines be useful in language theory?

DOI10.1016/j.tcs.2007.01.009zbMath1111.68054OpenAlexW2116637775MaRDI QIDQ880169

Margus Veanes, Yuri Gurevich, Charles Wallace

Publication date: 11 May 2007

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

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

zbMATH Keywords

evolutionary algorithmsabstract state machinelanguage theoryAsmLgraph-partition algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Proving properties of the Chord protocol using the ASM formalism ⋮ Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic

Uses Software

• AsmL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choiceless polynomial time
• Abstract state machines: a unifying view of models of computation and of system design frameworks
• Semantic essence of AsmL
• Handbook of Graph Grammars and Computing by Graph Transformation
• On polynomial time computation over unordered structures
• Evolving Algebras 1993: Lipari Guide
• Interactive Algorithms 2005 with Added Appendix
• Abstract state machines capture parallel algorithms
• An Efficient Algorithm for Graph Isomorphism
• Sequential abstract-state machines capture sequential algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: Can abstract state machines be useful in language theory?