Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2002: Developments in Language Theory pp 290–296Cite as

Some Remarks on Asynchronous Automata

  • Conference paper
  • First Online:

  • 318 Accesses

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

Abstract

This paper is concerned with the class of all asynchronous automata.We characterize isomorphically complete systems for this class with respect to the αi-products and present a description of languages accepted by asynchronous automata.

This work has been supported by the Hungarian National Foundation for Science Research, Grant T037258

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. Burris, S., Sankappanavar, H. P.: A Course in Universal Algebra. Springer-Verlag, New York Berlin (1981)

    MATH  Google Scholar 

  2. Eilenberg, S.: Automata, languages, and machines, Volume B. Academic Press, New York (1976)

    MATH  Google Scholar 

  3. Gerace, G. B., Gestri, G.: Decomposition of Synchronous Sequential Machines into Synchronous and Asynchronous Submachines. Information and Control 11 (1968) 568–591

    Article  MathSciNet  Google Scholar 

  4. Gerace, G. B., Gestri, G.: Decomposition of Synchronous Machine into an Asynchronous Submachine driving a Synchronous One. Information and Control 12 (1968) 538–548

    Article  MATH  MathSciNet  Google Scholar 

  5. Gécseg, F.: Composition of automata. In: Proceedings of the 2nd Colloquium on Automata, Languages and Programming, Saarbrücken, LNCS, Vol. 14. Springer-Verlag (1974) 351–363

    Google Scholar 

  6. Gécseg, F.: Products of Automata. Springer-Verlag, Berlin Heidelberg New York Tokyo (1986)

    Google Scholar 

  7. Grätzer, G.: Universal Algebra. 2nd edn. Springer-Verlag, New York Berlin Heidelberg Tokyo (1979)

    MATH  Google Scholar 

  8. Imreh, B.: On completeness with respect to the quasi-direct product. In: Conference on Automata, Languages and Mathematical Systems, Salgótarján (1984) 83–89

    Google Scholar 

  9. Imreh, B.: On αi-products of automata. Acta Cybernetica 3 (1978) 301–307

    MathSciNet  Google Scholar 

  10. Imreh, B., Ito, M., Pukler, A.: A note on the languages recognized by commutative asynchronous automata. RIMS Kokyuroku 1166 (2000) 95–99

    MATH  MathSciNet  Google Scholar 

  11. Imreh, B., Ito, M., Pukler, A.: On commutative asynchronous automata. In: Proceedings of the Third International Colloquium on Words, Languages, and Combinatorics, Kyoto 2000, to appear

    Google Scholar 

  12. Steinby, M.: Classifying Regular Languages by Their Syntactic Algebras. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds.): Results and Trends in Theoretical Computer Science. LNCS Vol. 812. Springer Verlag, Berlin Heidelberg New York (1994) 396–409

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, H-6720, Szeged, Hungary

    Balázs Imreh

Authors
  1. Balázs Imreh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Imreh, B. (2003). Some Remarks on Asynchronous Automata. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation