Skip to main content
SpringerLink
Log in

automata, a Hybrid System for Computational Automata Theory

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2608))

Included in the following conference series:

Abstract

We present a system that performs computations on finite state machines, syntactic semigroups, and one-dimensional cellular automata.

Supported in part by NSF-ITR 0113919.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.-P. Beal and D. Perrin. Symbolic dynamics and finite automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 2, chapter 10. Springer Verlag, 1997.

    Google Scholar 

  2. R. Fischer. Sofic systems and graphs. Monatshefte für Mathematik, 80:179–186, 1975.

    Article  MATH  Google Scholar 

  3. G. Glass and B. Schuchert. The STL Primer. Prentice Hall, 1996.

    Google Scholar 

  4. D. Kozen. Lower bounds for natural proof systems. In Proc. 18-th Ann. Symp. on Foundations of Computer Science, pages 254–266. IEEE Computer Society, 1977.

    Google Scholar 

  5. D. Lind and B. Marcus. Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.

    Google Scholar 

  6. R. Raymond, D. Wood, and S. Yu. First International Workshop on Implementing Automata, volume 1260 of Lecture Notes in CS. Springer Verlag, 1997.

    Google Scholar 

  7. B. Stroustrup. The C++ Programming Language. Addison-Wesley, 1997.

    Google Scholar 

  8. K. Sutner. Finite state machines and syntactic semigroups. The Mathematica Journal, 2(1):78–87, 1992.

    MathSciNet  Google Scholar 

  9. K. Sutner. Implementing finite state machines. In N. Dean and G. Shannon, editors, Computational Support for Discrete Mathematics, volume 15, pages 347–365. DIMACS, 1994.

    Google Scholar 

  10. K. Sutner. Linear cellular automata and Fischer automata. Parallel Computing, 23(11):1613–1634, 1997.

    Article  MathSciNet  Google Scholar 

  11. K. Sutner. σ-automata and Chebyshev polynomials. Theoretical Computer Science, 230:49–73, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. K. Sutner. Decomposition of additive cellular automata. Complex Systems, 13(3):245–270, 2001.

    MathSciNet  Google Scholar 

  13. K. Sutner. The size of power automata. In J. Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science, volume 2136 of SLNCS, pages 666–677, 2001.

    Chapter  Google Scholar 

  14. S. Wolfram. The Mathematica Book. Wolfram Media, Cambridge UP, 4th edition, 1999.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, 15213, Pittsburgh, PA

    Klaus Sutner

Authors
  1. Klaus Sutner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, Université de Rouen, LIFAR, 76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud

  2. Departement Informatique, Laboratoire d’Informatique de l’Université de Tours École Polytechnique de l’Université de Tours, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sutner, K. (2003). automata, a Hybrid System for Computational Automata Theory. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44977-9_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40391-3

  • Online ISBN: 978-3-540-44977-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation