Abstract
We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To this aim we give algebraic characterizations for the language operations of generating the polynomial closure and generating the unambiguous polynomial closure over traces.
We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to DA. All characterizations are known to hold for words.
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
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)
Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic Press, New York, London (1976)
Gastin, P., Mukund, M.: An elementary expressively complete temporal logic for Mazurkiewicz traces. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 938–949. Springer, Heidelberg (2002)
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB, vol. 78. Aarhus University, Aarhus (1977)
Ochmański, E.: Recognizable trace languages. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, ch. 6, pp. 167–204. World Scientific, Singapore (1995)
Pin, J.-É.: Varieties of Formal Languages. North Oxford Academic, London (1986)
Pin, J.-É.: A variety theorem without complementation. Russian Mathematics (Izvestija vuzov.Matematika) 39, 80–90 (1995)
Pin, J.-É., Straubing, H., Thérien, D.: Locally trivial categories and unambiguous concatenation. Journal of Pure and Applied Algebra 52, 297–311 (1988)
Pin, J.-É., Weil, P.: Profinite semigroups, Mal’cev products and identities. Journal of Algebra 182, 604–626 (1996)
Pin, J.-É., Weil, P.: Polynominal closure and unambiguous product. Theory Comput. Syst. 30(4), 383–422 (1997)
Tesson, P.: Personal communication
Tesson, P., Thérien, D.: Diamonds are Forever: The Variety DA. In: dos Gomes Moreira da Cunha, G.M., da Silva, P.V.A., Pin, J.-E. (eds.) Semigroups, Algorithms, Automata and Languages, Coimbra (Portugal) 2001, pp. 475–500. World Scientific, Singapore (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kufleitner, M. (2006). Polynomials, Fragments of Temporal Logic and the Variety DA over Traces. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_5
Download citation
DOI: https://doi.org/10.1007/11779148_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)