Abstract
We prove that the categories of \(\mathcal{C}\)-dioids of Hopkins 2008 and of \(\mu \)-continuous Chomsky-algebras of Grathwohl, Henglein and Kozen 2013 are the same.
Keywords
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.
H. Leiß—Retired from: Centrum für Informations- und Sprachverarbeitung, Ludwig-Maximilians-Universität München, Oettingenstr. 67, 80539 München.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bekić, H.: Definable operations in general algebras, and the theory of automata and flowcharts. In: Jones, C.B. (ed.) Programming Languages and Their Definition. LNCS, vol. 177, pp. 30–55. Springer, Heidelberg (1984). https://doi.org/10.1007/BFb0048939
de Bakker, J., Scott, D.: A theory of programs. IBM Seminar, Vienna (1969)
Grathwohl, N.B.B., Henglein, F., Kozen, D.: Infinitary axiomatization of the equational theory of context-free languages. In: Baelde, D., Carayol, A. (eds.) Fixed Points in Computer Science (FICS 2013). EPTCS, vol. 126, pp. 44–55 (2013)
Gunawardena, J. (ed.): Idempotency. Publications of the Newton Institute, Cambridge University Press, Cambridge (1998)
Harrison, M.: Introduction to Formal Languages. Addison Wesley, Reading (1978)
Hopkins, M.: The algebraic approach I: the algebraization of the chomsky hierarchy. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2008. LNCS, vol. 4988, pp. 155–172. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78913-0_13
Hopkins, M.: The algebraic approach II: dioids, quantales and monads. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2008. LNCS, vol. 4988, pp. 173–190. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78913-0_14
Hopkins, M., Leiß, H.: Coequalizers and tensor products for continuous idempotent semirings. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) RAMiCS 2018. LNCS, vol. 11194, pp. 37–52. Springer, Cham (2018)
Kozen, D.: On induction vs. *-continuity. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 167–176. Springer, Heidelberg (1982). https://doi.org/10.1007/BFb0025782
Kozen, D.: Results on the propositional \(\mu \)-calculus. Theor. Comput. Sci. 27(3), 333–354 (1983)
Leiß, H.: The matrix ring of a \(\mu \)-continuous Chomsky algebra is \(\mu \)-continuous. In: Regnier, L., Talbot, J.-M. (eds.) 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics, pp. 1–16. Leibniz-Zentrum für Informatik, Dagstuhl Publishing (2016)
Leiß, H., Ésik, Z.: Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Log. 133, 173–203 (2005)
Mac Lane, S.: Categories for the Working Mathematician. Springer, New York (1971). https://doi.org/10.1007/978-1-4612-9839-7
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Leiß, H., Hopkins, M. (2018). C-Dioids and \(\mu \)-Continuous Chomsky-Algebras. In: Desharnais, J., Guttmann, W., Joosten, S. (eds) Relational and Algebraic Methods in Computer Science. RAMiCS 2018. Lecture Notes in Computer Science(), vol 11194. Springer, Cham. https://doi.org/10.1007/978-3-030-02149-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-02149-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02148-1
Online ISBN: 978-3-030-02149-8
eBook Packages: Computer ScienceComputer Science (R0)