Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1993: Automata, Languages and Programming pp 445–456Cite as

On regular compatibility of semi-commutations

  • Conference paper
  • First Online:

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

Abstract

A semi-commutation θ′ is \(\mathcal{R}\mathcal{E}\mathcal{G}\)-compatible with a semi-commutation θ iff the θ′-closure of any regular θ-closed language remains regular. The paper presents a decidable criterion, characterizing couples of \(\mathcal{R}\mathcal{E}\mathcal{G}\)-compatible semi-commutations. The complexity of the problem is shown to be co-NP-complete.

This work has been partially sponsored by the EBRA Working Group 3166 ASMICS, by the PRC “Mathématiques et Informatique”, and by the KBN Research Project 2 2047 32 03.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Clerbout/M.Latteux, On a generalization of partial commutation; 4th Hungarian Computer Science Conference's proceedings, pp. 15–24 (1985); Extended version: Semi-commutations; Information & Computation 73, pp.59–74 (1987)

    Google Scholar 

  2. M.Clerbout/M.Latteux/Y.Roos/W.Zielonka, Semi-commutations and rational expressions; 19th ICALP proceedings, LNCS 623, pp. 113–125 (1992)

    Google Scholar 

  3. V.Diekert/E.Ochmański/K.Reinhardt, On confluent semi-commutations — decidability and complexity results; 18th ICALP proceedings, LNCS 510, pp. 229–241 (1991) Extended version to appear in Information & Computation.

    Google Scholar 

  4. K. Hashiguchi, Recognizable closures and submonoids of free partially commutative monoids; Theoretical Computer Science 86, pp. 233–241 (1991)

    Google Scholar 

  5. D.V.Hung/E.Knuth, Semi-commutations and Petri Nets; Theoretical Computer Science 64, pp. 67–82 (1989)

    Google Scholar 

  6. E.Ochmański, Modelling concurrency with semi-commutations; 17th MFCS proceedings, LNCS 629, pp. 412–420 (1992)

    Google Scholar 

  7. Y.Roos/P.A.Wacrenier, Composition of two semi-commutations; 16th MFCS proceedings, LNCS 520, pp. 406–414 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Podstaw Informatyki, Polska Akademia Nauk, Ordona 21, 01-237, Warszawa

    Edward Ochmański

  2. CNRS URA 369, LIFL, Bât.M3, Université de Lille 1, 59655, Villeneuve d'Ascq

    Pierre-André Wacrenier

Authors
  1. Edward Ochmański
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre-André Wacrenier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Lingas Rolf Karlsson Svante Carlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ochmański, E., Wacrenier, PA. (1993). On regular compatibility of semi-commutations. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-56939-1_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56939-8

  • Online ISBN: 978-3-540-47826-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation