Abstract
We use first–order logic with transitive closure operator FO(TC1) for deciding first–order linear monoid properties. These are written in the style of linear sentences of Ron V. Book, but with a less restrictive language. The decidability of such properties concerns monoids presented by recognizable convergent suffix semi–Thue systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Sethi, R., Ullman, J.D.: Code optimization and finite Church–Rosser systems. In: Rustin, R. (ed.) Design and Optimization of Compilers, pp. 89–106. Prentice–Hall, Upper Saddle River (1972)
Arnold, A., Niwiński, D.: Rudiments of μ–calculus. Number 146 in Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam (2001)
Barthelmann, K.: On equational simple graphs. Technical Report 9/97, Johannes Gutenberg Universität, Mainz (1998)
Blumensath, A.: Axiomatising tree-interpretable structures. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 596–607. Springer, Heidelberg (2002)
Book, R.V.: Decidable sentences of Church–Rosser congruences. Theoretical Comput. Sci. 24, 301–312 (1983)
Book, R.V., Otto, F.: On the security of name–stamp protocols. Theoretical Comput. Sci. 39, 319–325 (1985)
Book, R.V., Otto, F.: On the verifiability of two–party algebraic protocols. Theoretical Comput. Sci. 40, 101–130 (1985)
Book, R.V., Otto, F.: String–Rewriting Systems. Texts and Monographs in Computer Science. Springer, Heidelberg (1993)
Caucal, D.: On infinite transition graphs having a decidable monadic second–order theory. Theoretical Comput. Sci. 290(1), 79–115 (2003)
Caucal, D., Knapik, T.: A Chomsky–like hierarchy of infinite graphs. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 177–187. Springer, Heidelberg (2002)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)
Fagin, R.: Monadic generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 21, 89–96 (1975)
Immerman, N., Vardi, M.Y.: Model checking and transitive-closure logic. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 291–302. Springer, Heidelberg (1997)
Knapik, T., Calbrix, H.: Thue specifications and their monadic second–order properties. Fundamenta Informaticae 39(3), 305–325 (1999)
Kupferman, O., Vardi, M.Y.: An automata–theoretic approach to reasoning about infinite–state systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 36–52. Springer, Heidelberg (2000)
Madlener, K., Otto, F.: Decidable sentences for context–free groups. In: Choffrut, C., Jantzen, M. (eds.) STACS 1991. LNCS, vol. 480, pp. 160–171. Springer, Heidelberg (1991)
Oleshchuk, V.A.: On public–key cryptosystem based on Church–Rosser string–rewriting systems. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 264–269. Springer, Heidelberg (1995)
Thue, A.: Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Skr. Vid. Kristiania, I Mat. Natuv. Klasse, 10, 34 (1914)
Walukiewicz, I.: Monadic second–order logic on tree–like structures. Theoretical Comput. Sci. 275(1–2), 311–346 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delhommé, C., Knapik, T., Thomas, D.G. (2003). Using Transitive–Closure Logic for Deciding Linear Properties of Monoids. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive