Reordering Derivatives of Trace Closures of Regular Languages.

DOI10.4230/LIPIcs.CONCUR.2019.40OpenAlexW2971156240MaRDI QIDQ5875402

Tarmo Uustalu, Hendrik Maarand

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2019.40

zbMATH Keywords

finite automataregular languagesMazurkiewicz traceslanguage derivativesscattering rankstar-connected expressionstrace closure

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent Kleene algebra and its foundations
• Partial derivatives of regular expressions and finite automaton constructions
• Semi-commutations
• On regular trace languages
• Recognizable closures and submonoids of free partially commutative monoids
• A completeness theorem for Kleene algebras and the algebra of regular events
• Derivatives for Regular Shuffle Expressions
• Automata Studies. (AM-34)
• Trace languages defined by regular string languages
• Notes on finite asynchronous automata
• Partial Derivative Automaton for Regular Expressions with Shuffle
• Derivatives of Regular Expressions

This page was built for publication: Reordering Derivatives of Trace Closures of Regular Languages.