Can abstract state machines be useful in language theory?
From MaRDI portal
(Redirected from Publication:880169)
Recommendations
Cites work
- scientific article; zbMATH DE number 5604097 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1951198 (Why is no real title available?)
- scientific article; zbMATH DE number 970830 (Why is no real title available?)
- Abstract state machines capture parallel algorithms
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- An Efficient Algorithm for Graph Isomorphism
- Choiceless polynomial time
- Evolutionary computation. 1. Basic algorithms and operators
- Evolving Algebras 1993: Lipari Guide
- Handbook of Graph Grammars and Computing by Graph Transformation
- Interactive Algorithms 2005 with Added Appendix
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On polynomial time computation over unordered structures
- Semantic essence of AsmL
- Sequential abstract-state machines capture sequential algorithms
Cited in
(3)
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)