Equivalence and membership problems for regular trace languages | SpringerLink
Skip to main content
Springer Nature Link
Log in

Equivalence and membership problems for regular trace languages

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 140))

Included in the following conference series:

  • 605 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertoni,A.,Brambilla,M.,Mauri,G.,Sabadini,N., An application of the theory of free partially commutative monoids: asymptotic densities of trace languages,Lect.Not.Comp.Sci.,118,Springer, 1981.

    Google Scholar 

  2. Bertoni,A.,Mauri,G.,Sabadini,N.,A hierarchy of regular trace languages and some combinatorial applications,Second World Conference on Mathematics at the Service of Men,Las Palmas,1982.

    Google Scholar 

  3. Dilworth,R.P.,A decomposition theorem for partially ordered sets,Ann.of Math.51,1950,pp.161–166.

    Article  MathSciNet  Google Scholar 

  4. Garey,M., Johnson,D.J.,Computers and intractability,Freeman and Co, San Francisco,1979.

    MATH  Google Scholar 

  5. Hopcroft,J.E.,Ullman,J.D.,Formal languages and their relations to automata, Addison Wesley,Reading Mass.,1969.

    MATH  Google Scholar 

  6. Knuth,E.,Petri Nets and regular trace languages, Univ. of Newcastle upon Tyne,Comp.Lab.,ASM/47,1978.

    Google Scholar 

  7. Lallement,G.,Semigroups and combinatorial applications,J.Wiley and Sons, New York,1979.

    MATH  Google Scholar 

  8. Mazurkiewicz,A.,Concurrent program schemes and their interpretations, DAIMI,PB 78,Aarhus University,1977.

    Google Scholar 

  9. Petri,C.A.,Non sequential processes,ISF Rep.77/01,GMD Bonn,1977.

    Google Scholar 

  10. Szijarto,M.,Trace languages and closure operations,Automata Theoretic Letters,1979/2,Dept.of numerical and computer math., L.Eotvos University, Budapest,1979.

    Google Scholar 

  11. Fisher,P.C.,Rosenberg,A.L.,Multitape non writing automata,J.C.S.S., 2,1968,pp.88–101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Cibernetica, Università di Milano, Italia

    A. Bertoni, G. Mauri & N. Sabadini

  2. Istituto di Matematica, Università della Calabria, Italia

    A. Bertoni

  3. Istituto di Matematica, Università di Udine, Italia

    G. Mauri

Authors
  1. A. Bertoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Sabadini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertoni, A., Mauri, G., Sabadini, N. (1982). Equivalence and membership problems for regular trace languages. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012757

Download citation

  • DOI: https://doi.org/10.1007/BFb0012757

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation