Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Workshop on Coalgebraic Methods in Computer Science

CMCS 2012: Coalgebraic Methods in Computer Science pp 90–108Cite as

  1. Home
  2. Coalgebraic Methods in Computer Science
  3. Conference paper
Stream Automata Are Coalgebras

Stream Automata Are Coalgebras

  • Vincenzo Ciancia18 &
  • Yde Venema18 
  • Conference paper
  • 656 Accesses

  • 3 Citations

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

Abstract

Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that coalgebraic bisimilarity coincides with language equivalence. From this characterisation, we derive concise and natural decision procedures for complementation, union, intersection, and equivalence check.

Keywords

  • Boolean Operation
  • Equivalence Check
  • Regular Language
  • Empty Word
  • Unique Morphism

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Work supported by the second author’s VICI grant 639.073.501 of the Netherlands Organization for Scientific Research (NWO).

Download conference paper PDF

References

  1. Bartels, F., Sokolova, A., de Vink, E.P.: A hierarchy of probabilistic system types. Theoretical Computer Science 327(1-2), 3–22 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: LICS, pp. 355–364. IEEE Computer Society (2011)

    Google Scholar 

  3. Bonchi, F., Bonsangue, M., Rutten, J., Silva, A.: Deriving Syntax and Axioms for Quantitative Regular Behaviours. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 146–162. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  4. Calbrix, H., Nivat, M., Podelski, A.: Ultimately Periodic Words of Rational ω-Languages. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 554–566. Springer, Heidelberg (1994)

    CrossRef  Google Scholar 

  5. Ciancia, V., Tuosto, E.: A novel class of automata for languages on infinite alphabets. Tech. rep., University of Leicester (2009)

    Google Scholar 

  6. Worrell, J.: Terminal sequences for accessible endofunctors. In: CMCS. Electronic Notes in Theoretical Computer Science, vol. 19, pp. 24–38. Elsevier (1999)

    Google Scholar 

  7. Pin, J.E., Perrin, D.: Infinite Words: Automata, Semigroups, Logic and Games. Elsevier (2004)

    Google Scholar 

  8. Rutten, J.: Automata and Coinduction (An Exercise in Coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 194–218. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  9. Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Venema, Y.: Automata and fixed point logic: A coalgebraic perspective. Information and Computation 204(4), 637–678 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Logic, Language and Computation, University of Amsterdam, The Netherlands

    Vincenzo Ciancia & Yde Venema

Authors
  1. Vincenzo Ciancia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yde Venema
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research School of Information Sciences and Engineering, The Australian National University, 0200, Canberra, ACT, Australia

    Dirk Pattinson

  2. Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058, Erlangen, Germany

    Lutz Schröder

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Ciancia, V., Venema, Y. (2012). Stream Automata Are Coalgebras. In: Pattinson, D., Schröder, L. (eds) Coalgebraic Methods in Computer Science. CMCS 2012. Lecture Notes in Computer Science, vol 7399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32784-1_6

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-32784-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32783-4

  • Online ISBN: 978-3-642-32784-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature