Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2000: Implementation and Application of Automata pp 318–326Cite as

The MERLin Environment Applied to ⋆-NFAs

  • Conference paper
  • First Online:

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

Abstract

There are known mechanisms to succinctly describe regular languages, such as nondeterministic finite automata, boolean automata, and statecharts. The MERLin project is an investigation into and comparison of different description mechanisms for the regular languages. In particular, we are concerned with descriptions which, for a specific application domain, often achieve succinctness. To this end we implemented a Modelling Environment for Regular Languages (MERLin). This paper describes the application of the MERLin system to analyze the behaviour of selective nondeterministic finite automata.

This research was supported by grants from the University of Stellenbosch.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T.L. Stirling et al, How to Build a Beowulf: A Guide to the Implementation and Application of PC Clusters. MIT Press, Scientific and Engineering Computation Series, 1999.

    Google Scholar 

  2. M. Chrobak, Finite Automata and Unary Languages. Theoretical Computer Science 47(1986), pp. 149–158.

    Article  MATH  MathSciNet  Google Scholar 

  3. L.L. Dornhoff and F.E. Hohn, Applied Modern Algebra. MacMillan Publishing Co., Inc., New York, 1977.

    Google Scholar 

  4. S.W. Golomb, Shift Register Sequences. Holden-Day, Inc., 1967.

    Google Scholar 

  5. D. Harel, Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8(1987), pp. 231–274.

    Article  MATH  MathSciNet  Google Scholar 

  6. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Massachusetts, 1979.

    MATH  Google Scholar 

  7. P. L’Ecuyer, Maximally Equidistributed Combined Tausworthe Generators. Mathematics of Computation 65(213):203–213, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. L’Ecuyer, Testing Random Number Generators. Proceedings of the 1992 Winter Simulation Conference, IEEE Press, Dec. 1992, pp.305–313.

    Google Scholar 

  9. K. Mehlhorn et al, The LEDA User Manual Version 4.0. Max-Planck-Institut für Informatik, Saarbrücken, Germany. http://www.mpi-sb.mpg.de/LEDA

  10. E. Leiss, Succinct Representation of Regular Languages by Boolean Automata. Theoretical Computer Science 13 (1981), pp. 323–330.

    Article  MATH  MathSciNet  Google Scholar 

  11. T.K.S. Leslie, Efficient Approaches to Subset Construction. MSc Thesis, University of Waterloo, Waterloo, Canada, 1994.

    Google Scholar 

  12. A.R. Meyer and M.J. Fischer, Economy of Description by Automata, Grammars, and Formal Systems. Proc. of the 12th Annual IEEE Symposium on Switching and Automata Theory, October 1971, Michigan, pp. 188–191.

    Google Scholar 

  13. D. Raymond and D. Wood, The User’s Guide to Grail. University of Waterloo, Waterloo, Canada, 1995. http://www.csd.uwo.ca/research/grail

  14. A.P.J. van der Walt and L. van Zijl, ⋆-Realizations of Deterministic Finite Automata. British Colloquium for Theoretical Computer Science 11, Swansea, Wallis, April 1995.

    Google Scholar 

  15. L. van Zijl, Generalized Nondeterminism and the Succinct Representation of Regular Languages. PhD dissertation, Stellenbosch University, March 1997. http://www.cs.sun.ac.za/~lynette/boek.ps.gz

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stellenbosch University, South Africa

    Lynette van Zijl, John-Paul Harper & Frank Olivier

Authors
  1. Lynette van Zijl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John-Paul Harper
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank Olivier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Zijl, L., Harper, JP., Olivier, F. (2001). The MERLin Environment Applied to ⋆-NFAs. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation