Advertisement

On the logical definability of some rational trace languages

  • C. Choffrut
  • L. Guerra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

Abstract

Trace monoids are obtained from free monoids by defining a subset I of pairs of letters that are allowed to commute. Most of the work of this theory is an attempt to relate the properties of these monoids to the properties of I. Following the work initiated by Büchi we show that when I is an equivalence relation (the trace monoid is then a free product of free commutative monoids) it is possible to define a second order logic whose models are the traces viewed as dependence graphs and which characterizes exactly the sets of traces that are rational. This logic essentially utilizes a predicate based on the ordering defined by the dependence graph and a predicate related to a restricted use of the comparison of cardinality.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    IJ.J. AALBERSBERG, G. ROZENBERG, Theory of traces, Theoret. Comput. Sci. 60, 1988, 1–82Google Scholar
  2. [2]
    IJ.J. AALBERSBERG, E. WELZL, Trace languages defined by regular string languages, RAIRO Inform. Théor. Applic. 20, 1986, 103–119Google Scholar
  3. [3]
    J. BERSTEL, Transductions and Context-Free Languages, Teubner, 1979Google Scholar
  4. [4]
    A. BERTONI, G. MAURI, N. SABADINI, Unambiguous regular trace languages, in Algebra, Combinatorics and Logic, (J. Demetrovics, G. Katona and A. Salomaa, eds), Col. Math. Soc. Janos Bolyay 42, North Holland, 1985Google Scholar
  5. [5]
    J.R. BÜCHI, Weak Second Order Logic and Finite Automata. Z. Math. Logik Grundlagen Math. 6, 1960, 66–92Google Scholar
  6. [6]
    C.C. ELGOT, Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc. 98, 1961, 21–52Google Scholar
  7. [7]
    S. GINSBURG, E.H. SPANIER, Semigroups, Presburber Formulas, and Languages, Pacific J. Math 16, 1966, 285–296Google Scholar
  8. [8]
    H. LÄUCHLI, C. SAVIOZ, Monadic second order definable relations on the binary tree, J. of Symbolic Logic 52, 1987, 219–226Google Scholar
  9. [9]
    J.D. Jr. Mac KNIGHT, A.J. STOREY, Equidivisible semigroups, J. of Algebra 12, 1969, 24–48Google Scholar
  10. [10]
    R. McNAUGHTON, S. PAPERT, Counter-free-Automata MIT Press, Cambridge Massachussets 1971Google Scholar
  11. [11]
    D. PERRIN, J.-E. PIN, First order Logic and Star-Free Sets, J. Comput. System Sci. 32, 1986, 393–406Google Scholar
  12. [12]
    J. SAKAROVITCH, The ”Last” Decision Problem, Proceedings of LATIN'92, I. Simon (Ed.) LNCS 583, 460–473Google Scholar
  13. [13]
    W. THOMAS, Classifying Regular Events in Symbolic Logic, J. Comput. System Sci. 25, 1982, 360–376Google Scholar
  14. [14]
    W. THOMAS, On logical definability of trace languages, Proceedings of the Workshop of the ASMICS Group held in Kochel am See, Tech. Report TUM I9002, Universität München, 1990Google Scholar
  15. [15]
    W. THOMAS, Infinite trees and automaton definable relations over ω-words, Proceedings of the 7-th STACS Conference held in Rouen, Lecture Notes in Computer Science 415, 1990, 263–279Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • C. Choffrut
    • 1
  • L. Guerra
    • 1
  1. 1.LITP Tour 55-56Université Paris 7Paris Cedex

Personalised recommendations