Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2006: Developments in Language Theory pp 14–19Cite as

Can Abstract State Machines Be Useful in Language Theory?

  • Conference paper

  • 371 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4036)

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.

Keywords

  • Turing Machine
  • Abstraction Level
  • Language Theory
  • Splitting Process
  • Abstract State Machine

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Chapter
EUR   29.95
Price includes VAT (Finland)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR   42.79
Price includes VAT (Finland)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR   54.99
Price includes VAT (Finland)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abstract State Machines, http://www.eecs.umich.edu/groups/gasm/

  2. Abstract State Machine Language (AsmL), http://research.microsoft.com/fse/asml/

  3. Blass, A., Gurevich, Y.: Algorithms: A Quest for Absolute Definitions. Bulletin of the European Association for Theoretical Computer Science 81, 195–225 (2003)

    MATH  MathSciNet  Google Scholar 

  4. Blass, A., Gurevich, Y., Shelah, S.: Choiceless Polynomial Time. Annals of Pure and Applied Logic 100, 141–187 (1999)

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. Blass, A., Gurevich, Y., Shelah, S.: On Polynomial Time Computation Over Unordered Structures. Journal of Symbolic Logic 67(3), 1093–1125 (2002)

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. 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)

    CrossRef  MATH  MathSciNet  Google Scholar 

  7. 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)

    CrossRef  Google Scholar 

  8. Gurevich, Y.: Evolving Algebras 1993: Lipari Guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)

    Google Scholar 

  9. Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)

    CrossRef  MathSciNet  Google Scholar 

  10. Gurevich, Y., Rossman, B., Schulte, W.: Semantic Essence of AsmL. Theoretical Computer Science 343(3), 370–412 (2005)

    CrossRef  MATH  MathSciNet  Google Scholar 

  11. Gurevich, Y.: Interactive Algorithms 2005. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 26–38. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  12. Nerode, A.: Linear Automaton Transformations. Proceedings of the American Mathematical Society 9, 541–544 (1958)

    CrossRef  MATH  MathSciNet  Google Scholar 

  13. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1 - Foundations. World Scientific, Singapore (1997)

    Google Scholar 

  14. 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, Redmond, WA, 98052, USA

    Yuri Gurevich

  2. Michigan Technological University, Houghton, MI, 49931, USA

    Charles Wallace

Authors
  1. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Charles Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints 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)

Search

Navigation