Can abstract state machines be useful in language theory?
type: Item
instance of: scholarly article
title: Can abstract state machines be useful in language theory?
zbMATH Open document ID: 1111.68054
author: Yuri Gurevich
author: Margus Veanes
author: Charles Wallace
published in: Theoretical Computer Science
publication date: 2007-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5151694
zbMATH Keywords: abstract state machine
zbMATH Keywords: AsmL
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: graph-partition algorithm
zbMATH Keywords: language theory
describes a project that uses: AsmL
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.01.009
OpenAlex ID: W2116637775
cites work: Q5689036
cites work: Evolutionary computation. 1. Basic algorithms and operators
cites work: Q3395980
cites work: Abstract state machines capture parallel algorithms
cites work: Choiceless polynomial time
cites work: On polynomial time computation over unordered structures
cites work: Abstract state machines: a unifying view of models of computation and of system design frameworks
cites work: An Efficient Algorithm for Graph Isomorphism
cites work: Q4413688
cites work: Evolving Algebras 1993: Lipari Guide
cites work: Sequential abstract-state machines capture sequential algorithms
cites work: Interactive Algorithms 2005 with Added Appendix
cites work: Semantic essence of AsmL
cites work: Q4344149
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
DOI: 10.1016/J.TCS.2007.01.009
description: scientific article; zbMATH DE number 5151694