Can abstract state machines be useful in language theory?
From MaRDI portal
Publication:880169
DOI10.1016/J.TCS.2007.01.009zbMATH Open1111.68054OpenAlexW2116637775MaRDI QIDQ880169FDOQ880169
Authors: Yuri Gurevich, Margus Veanes, 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
Recommendations
Cites Work
- Semantic essence of AsmL
- Title not available (Why is that?)
- Evolving Algebras 1993: Lipari Guide
- Handbook of Graph Grammars and Computing by Graph Transformation
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Evolutionary computation. 1. Basic algorithms and operators
- Title not available (Why is that?)
- Abstract state machines capture parallel algorithms
- Sequential abstract-state machines capture sequential algorithms
- An Efficient Algorithm for Graph Isomorphism
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- Interactive Algorithms 2005 with Added Appendix
- Title not available (Why is that?)
- Choiceless polynomial time
- On polynomial time computation over unordered structures
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Can abstract state machines be useful in language theory?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880169)
