Document Open Access Logo

Reordering Derivatives of Trace Closures of Regular Languages

Authors Hendrik Maarand , Tarmo Uustalu



PDF
Thumbnail PDF

File

LIPIcs.CONCUR.2019.40.pdf
  • Filesize: 0.49 MB
  • 16 pages

Document Identifiers

Author Details

Hendrik Maarand
  • Department of Software Science, Tallinn University of Technology, Estonia
Tarmo Uustalu
  • School of Computer Science, Reykjavik University, Iceland
  • Department of Software Science, Tallinn University of Technology, Estonia

Acknowledgements

We thank Pierre-Louis Curien, Jacques Sakarovitch, Simon Doherty, Georg Struth and Ralf Hinze for inspiring discussions, and our anonymous reviewers for the exceptionally thorough and constructive feedback they gave us.

Cite AsGet BibTex

Hendrik Maarand and Tarmo Uustalu. Reordering Derivatives of Trace Closures of Regular Languages. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.CONCUR.2019.40

Abstract

We provide syntactic derivative-like operations, defined by recursion on regular expressions, in the styles of both Brzozowski and Antimirov, for trace closures of regular languages. Just as the Brzozowski and Antimirov derivative operations for regular languages, these syntactic reordering derivative operations yield deterministic and nondeterministic automata respectively. But trace closures of regular languages are in general not regular, hence these automata cannot generally be finite. Still, as we show, for star-connected expressions, the Antimirov and Brzozowski automata, suitably quotiented, are finite. We also define a refined version of the Antimirov reordering derivative operation where parts-of-derivatives (states of the automaton) are nonempty lists of regular expressions rather than single regular expressions. We define the uniform scattering rank of a language and show that, for a regexp whose language has finite uniform scattering rank, the truncation of the (generally infinite) refined Antimirov automaton, obtained by removing long states, is finite without any quotienting, but still accepts the trace closure. We also show that star-connected languages have finite uniform scattering rank.

Subject Classification

ACM Subject Classification
  • Theory of computation → Regular languages
  • Theory of computation → Concurrency
Keywords
  • Mazurkiewicz traces
  • trace closure
  • regular languages
  • finite automata
  • language derivatives
  • scattering rank
  • star-connected expressions

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. IJsbrand Jan Aalbersberg and Emo Welzl. Trace Languages Defined by Regular String Languages. Theor. Inf. Appl., 20(2):103-119, 1986. URL: https://doi.org/10.1051/ita/1986200201031.
  2. Valentin M. Antimirov. Partial Derivatives of Regular Expressions and Finite Automaton Constructions. Theor. Comput. Sci., 155(2):291-319, 1996. URL: https://doi.org/10.1016/0304-3975(95)00182-4.
  3. Alberto Bertoni, Giancarlo Mauri, and Nicoletta Sabadini. Unambiguous Regular Trace Languages. In Janos Demetrovics, Gyula Katona, and Arto Salomaa, editors, Algebra, Combinatorics, and Logic in Computer Science, volume 42 of Colloquia Mathematica Societas János Bolyai, pages 113-123. North-Holland, 1986. Google Scholar
  4. Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Partial Derivative Automaton for Regular Expressions with Shuffle. In Jeffrey Shallit and Alexander Okhotin, editors, Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015, Proceedings, volume 9118 of Lecture Notes in Computer Science, pages 21-32. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-19225-3_2.
  5. Janusz A. Brzozowski. Derivatives of Regular Expressions. J. ACM, 11(4):481-494, 1964. URL: https://doi.org/10.1145/321239.321249.
  6. Mireille Clerbout and Michel Latteux. Semi-commutations. Inf. Comput., 73(1):59-74, 1987. URL: https://doi.org/10.1016/0890-5401(87)90040-X.
  7. Kosaburo Hashiguchi. Recognizable Closures and Submonoids of Free Partially Commutative Monoids. Theor. Comput. Sci., 86(2):233-241, 1991. URL: https://doi.org/10.1016/0304-3975(91)90019-X.
  8. Tony Hoare, Bernhard Möller, Georg Struth, and Ian Wehrman. Concurrent Kleene Algebra and Its Foundations. J. Log. Algebr. Program., 80(6):266-296, 2011. URL: https://doi.org/10.1016/j.jlap.2011.04.005.
  9. Stephen C. Kleene. Representation of Events in Nerve Sets and Finite Automata. In Claude E. Shannon and John McCarthy, editors, Automata Studies, volume 34 of Annals of Mathematics Studies, pages 3-42. Princeton University Press, 1956. Google Scholar
  10. Barbara Klunder, Edward Ochmański, and Krystyna Stawikowska. On Star-Connected Flat Languages. Fund. Inf., 67(1-3):93-105, 2005. URL: http://content.iospress.com/articles/fundamenta-informaticae/fi67-1-3-08.
  11. Dexter Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Inf. Comput., 110(2):366-390, 1994. URL: https://doi.org/10.1006/inco.1994.1037.
  12. Hendrik Maarand and Tarmo Uustalu. Reordering Derivatives of Trace Closures of Regular Languages. arXiv preprint 1908.03551, 2019. URL: http://arxiv.org/abs/1908.03551.
  13. Antoni Mazurkiewicz. Concurrent Program Schemes and Their Interpretations. DAIMI Rep. PB-78, University of Aarhus, 1978. Google Scholar
  14. Antoni Mazurkiewicz. Introduction to Trace Theory. In Volker Diekert, editor, The Book of Traces, pages 3-41. World Scientific, 1995. URL: https://doi.org/10.1142/9789814261456_0001.
  15. Edward Ochmański. Regular Behaviour of Concurrent Systems. Bull. EATCS, 27:56-67, 1985. Google Scholar
  16. Edward Ochmański. Recognizable Trace Languages. In Volker Diekert, editor, The Book of Traces, pages 167-204. World Scientific, 1995. URL: https://doi.org/10.1142/9789814261456_0006.
  17. Michael O. Rabin and Dana S. Scott. Finite Automata and Their Decision Problems. IBM J. Res. Devel., 3(2):114-125, 1959. URL: https://doi.org/10.1147/rd.32.0114.
  18. Jacques Sakarovitch. On Regular Trace Languages. Theor. Comput. Sci., 52:59-75, 1987. URL: https://doi.org/10.1016/0304-3975(87)90080-6.
  19. Jacques Sakarovitch. The "Last" Decision Problem for Rational Trace Languages. In Imre Simon, editor, LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings, volume 583 of Lecture Notes in Computer Science, pages 460-473. Springer, 1992. URL: https://doi.org/10.1007/BFb0023848.
  20. Martin Sulzmann and Peter Thiemann. Derivatives for Regular Shuffle Expressions. In Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, and Bianca Truthe, editors, Language and Automata Theory and Applications: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, volume 8977 of Lecture Notes in Computer Science, pages 275-286. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-15579-1_21.
  21. Wiesław Zielonka. Notes on Finite Asynchronous Automata. Theor. Inf. Appl., 21(2):99-135, 1987. URL: https://doi.org/10.1051/ita/1987210200991.
  22. Wiesław Zielonka. Asynchronous Automata. In Volker Diekert, editor, The Book of Traces, pages 205-247. World Scientific, 1995. URL: https://doi.org/10.1142/9789814261456_0007.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail