Skip to main content

On the Problem of Automata Set Representation

  • Chapter
  • 601 Accesses

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

Abstract

The main studied problem is: When for the given set Q of finite automata there exists another finite automaton A such that for each automaton A′ in Q there exist a subautomaton A″ of A (we restrict our attention to a special class of subautomata) and a homomorphism f of A″ into A′.

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

Buying options

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   49.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. Ajzerman, M.A., Gusev, L.A., Rozonoer, L.I., Smirnova, I.M., Tal’, A.A.: Logic, Automata, Algorithms, Moscow, Fizmatgiz 1963 (in Russian)

    Google Scholar 

  2. Brauer, W.: Gruppentheoretische Untersuchungen bei endlichen Automaten. Z. Angew. Math. Mech. 48, T113 - T115 (1968).

    MathSciNet  MATH  Google Scholar 

  3. Deussen, P.: On the algebraic theory of finite automata. ICC Bull. 4, 231–264 (1966).

    MathSciNet  Google Scholar 

  4. Gill, A.: Single-channel and multichannel finite-state machines. IEEE Trans. Computers C-19, 1073–1078 (1970).

    Google Scholar 

  5. Grzymala-Busse, J.W.: On the endomorphisms of finite automata. Math. Syst. Theory 4, 373–384 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  6. Grzymala-Busse, J.W.: Operation-preserving functions and autonomous factors of finite automata. J. Comput. Syst. Sci.5, 465–474 (1971).

    Google Scholar 

  7. Grzymala-Busse, J.W.: Subautomata of finite automata, associated with the change of operating time, Technical U. Poznan, Rep. 46, 1972 (in Polish).

    Google Scholar 

  8. Grzymala-Busse, J.W.: Generalized endomorphisms, congruences, and subautomata associated with the change of operating time of finite automata. Submitted for publication.

    Google Scholar 

  9. Grzymala-Busse, J.W.: Problems of time-invariance of finite automata. Submitted for publication.

    Google Scholar 

  10. Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines, Englwood Cliffs, N.J., Prentice-Hall, Inc. 1966.

    Google Scholar 

  11. Hotz, G.: On the mathematical theory of linear sequential networks, in Switch. Theory Space Technol. (Aiken, Main, Eds.), Stanford, Calif., Stanford University Press 1963.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Grzymala-Busse, J.W. (1973). On the Problem of Automata Set Representation. In: Brauer, W. (eds) GI Gesellschaft für Informatik e. V.. Lecture Notes in Computer Science, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-41148-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-41148-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-40668-7

  • Online ISBN: 978-3-662-41148-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics