Can abstract state machines be useful in language theory?
Document Type
Conference Proceeding
Publication Date
1-1-2006
Department
Department of Computer Science
Abstract
Abstract state machines (originally called evolving algebras) constitute a modern computation model [8]. ASMs describe algorithms without compromising the abstraction level. ASMs and ASM based tools have been used in academia and industry to give precise semantics for computing artifacts and to specify software and hardware [1, 2, 6]. In connection to the conference on Developments in Language Theory, we consider how and whether ASMs could be useful in language theory.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Gurevich, Y.,
&
Wallace, C.
(2006).
Can abstract state machines be useful in language theory?.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
4036 LNCS, 14-19.
http://doi.org/10.1007/11779148_2
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4002