Reordering Derivatives of Trace Closures of Regular Languages.
From MaRDI portal
Recommendations
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Partial derivatives of regular expressions and finite automaton constructions
- Partial derivatives of regular expressions and finite automata constructions
- Derivatives of regular expressions and an application
- Partial derivatives of an extended regular expression
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- Automata Studies. (AM-34)
- Concurrent Kleene algebra and its foundations
- Derivatives for regular shuffle expressions
- Derivatives of Regular Expressions
- scientific article; zbMATH DE number 4020497 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- Notes on finite asynchronous automata
- On regular trace languages
- On star-connected flat languages
- Partial Derivative Automaton for Regular Expressions with Shuffle
- Partial derivatives of regular expressions and finite automaton constructions
- Recognizable closures and submonoids of free partially commutative monoids
- Semi-commutations
- Trace languages defined by regular string languages
Cited in
(2)
This page was built for publication: Reordering Derivatives of Trace Closures of Regular Languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875402)