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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abstract State Machines, http://www.eecs.umich.edu/groups/gasm/
Abstract State Machine Language (AsmL), http://research.microsoft.com/fse/asml/
Blass, A., Gurevich, Y.: Algorithms: A Quest for Absolute Definitions. Bulletin of the European Association for Theoretical Computer Science 81, 195–225 (2003)
Blass, A., Gurevich, Y., Shelah, S.: Choiceless Polynomial Time. Annals of Pure and Applied Logic 100, 141–187 (1999)
Blass, A., Gurevich, Y., Shelah, S.: On Polynomial Time Computation Over Unordered Structures. Journal of Symbolic Logic 67(3), 1093–1125 (2002)
Börger, E.: Abstract State Machines: A Unifying View of Models of Computation and of System Design Frameworks. Annals of Pure and Applied Logic 133, 149–171 (2005)
Grädel, E., Nowack, A.: Quantum Computing and Abstract State Machines. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 309–323. Springer, Heidelberg (2003)
Gurevich, Y.: Evolving Algebras 1993: Lipari Guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)
Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)
Gurevich, Y., Rossman, B., Schulte, W.: Semantic Essence of AsmL. Theoretical Computer Science 343(3), 370–412 (2005)
Gurevich, Y.: Interactive Algorithms 2005. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 26–38. Springer, Heidelberg (2005)
Nerode, A.: Linear Automaton Transformations. Proceedings of the American Mathematical Society 9, 541–544 (1958)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1 - Foundations. World Scientific, Singapore (1997)
Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of London Mathematical Society, series 2, 42, pp. 230–265 (1936-1937), Correction, ibidem, 43, 544–546
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gurevich, Y., Wallace, C. (2006). Can Abstract State Machines Be Useful in Language Theory?. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_2
Download citation
DOI: https://doi.org/10.1007/11779148_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)