iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BFb0031391
Efficient implementation of regular languages using r-AFA | SpringerLink
Skip to main content
Springer Nature Link
Log in

Efficient implementation of regular languages using r-AFA

  • Contributed Papers
  • Conference paper
  • First Online:
Automata Implementation (WIA 1997)

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

Included in the following conference series:

Abstract

We introduce a bit-wise representation of r-AFA transition functions and describe an efficient implementation method for r-AFA and their operations using this representation. Experiments have shown that this implementation is much more efficient than the Grail DFA implementation in both space and time.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel and M. Morcrette, “Compact representation of patterns by finite antomata”, Pixim 89: L'Image Numérique à Paris, André Gagalowicz, ed., Hermes, Paris, 1989, pp.387–395.

    Google Scholar 

  2. J.A. Brzozowski and E. Leiss, “On Equations for Regular Languages, Finite Automata, and Sequential Networks”, Theoretical Computer Science 10 (1980) 19–35.

    Google Scholar 

  3. A.K. Chandra, D.C. Kozen, L.J. Stockmeyer, “Alternation”, Journal of the ACM 28 (1981) 114–133.

    Google Scholar 

  4. H.K. Cheung, An Efficient Implementation Method for Alternating Finite Automata, MSc Project Paper, Dept. of Computer Science, Univ. of Western Ontario, Sept. 1996.

    Google Scholar 

  5. Olivier Coudert, “Two-Level Logic Minimization: An Overview”, The VLSI Journal 17 (1994) 97–140.

    Google Scholar 

  6. K. Culik II and J. Kari, “Image Compression Using Weighted Finite Automata”, Computer and Graphics, vol. 17, 3, (1993) 305–313.

    Google Scholar 

  7. A.Fellah, Alternating Finite Automata and Related Problems. Ph.D dissertation, Kent State Univ. 1991.

    Google Scholar 

  8. A.Fellah, H.Jürgensen, and S.Yu, “Constructions for Alternating Finite Automata”, Intern J. Comp. Math. 35 (1990) 117–132.

    Google Scholar 

  9. L. Guo, K. Salomaa, and S. Yu, “Synchronization Expressions and Languages”, Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing (1994) 257–264

    Google Scholar 

  10. D. Harel, “Statecharts: a visual formalism for complex systems”, Science of Computer Programming 8 (1987) 231–274.

    Google Scholar 

  11. H.B. Hunt, D.J. Rosenkrantz, and T.G. Szymanski, “On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages”, Journal of Computer and System Sciences 12 (1976) 222–268.

    Google Scholar 

  12. T. Jiang and B. Ravikumar, “Minimal NFA Problems are Hard”, SIAM Journal on Computing 22 (1993) 1117–1141.

    Google Scholar 

  13. J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen, Object-Oriented Modeling and Design, Prentice-Hall, 1991.

    Google Scholar 

  14. D. Raymond and D. Wood, Release Notes for Grail Version 2.5, Dept. of Computer Science, Univ. of Western Ontario, 1996.

    Google Scholar 

  15. L. Stockmeyer and A. Meyer, “Word problems requiring exponential time (preliminary report)”, Proceedings of the 5th ACM Symposium on Theory of Computing, (1973) 1–9.

    Google Scholar 

  16. D. Wood, Theory of Computation, John Wiley & Sons, New York, 1987.

    Google Scholar 

  17. S. Yu, “Regular Languages”, Chapter 2, Handbook of Formal Languages, vol. 1, Springer 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    K. Salomaa, X. Wu & S. Yu

Authors
  1. K. Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. X. Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salomaa, K., Wu, X., Yu, S. (1998). Efficient implementation of regular languages using r-AFA. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031391

Download citation

  • DOI: https://doi.org/10.1007/BFb0031391

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64694-5

  • Online ISBN: 978-3-540-69104-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation