Skip to main content
SpringerLink
Log in

The Generalization of Generalized Automata: Expression Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2004)

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

Included in the following conference series:

Abstract

We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano’s definition of deterministic generalized automata. We prove that deterministic expression automata languages are a proper subfamily of the regular languages. We define the minimization of deterministic expression automata. Lastly, we discuss prime prefix-free regular languages.

Note that we have omitted almost all proofs in this preliminary version.

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. Brzozowski, J., McCluskey Jr., E.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Electronic Computers EC-12, 67–76 (1963)

    Article  Google Scholar 

  2. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science 14, 1019–1032 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)

    MATH  Google Scholar 

  4. Giammarresi, D., Montalbano, R.: Deterministic generalized automata. Theoretical Comput. Sci. 215, 191–208 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hopcroft, J.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189–196. Academic Press, New York

    Google Scholar 

  6. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  7. Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica 15(3), 339–351 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Moore, E.: Gedanken experiments on sequential machines. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 129–153. Princeton University Press, Princeton (1956)

    Google Scholar 

  9. Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Formal Models and Semantics. Handbook of Theoretical Computer Science, vol. B, pp. 1–57. The MIT Press, Cambridge (1990)

    Google Scholar 

  10. Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory (DLT 1999), pp. 22–31. World Scientific, Singapore (2000)

    Google Scholar 

  11. Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 1–9 (1973)

    Google Scholar 

  12. Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York (1987)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong

    Yo-Sub Han & Derick Wood

Authors
  1. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derick Wood
    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 Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Turku, Finland

    Alexander Okhotin

  3. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

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

    Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, YS., Wood, D. (2005). The Generalization of Generalized Automata: Expression Automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24318-2

  • Online ISBN: 978-3-540-30500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation