The following pages link to On regular trace languages (Q1097040):
Displaying 24 items.
- A remark on the representation of trace monoids (Q584429) (← links)
- On bounded rational trace languages (Q970110) (← links)
- Efficient recognition of trace languages defined by repeat-until loops (Q989291) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- Theory of traces (Q1107296) (← links)
- Star-free trace languages (Q1193878) (← links)
- On the decidability of the equivalence problem for partially commutative rational power series (Q1193904) (← links)
- Recognizable trace languages, distributed automata and the distribution problem (Q1323363) (← links)
- Symmetries of the partial order of traces (Q1568667) (← links)
- The lattices of prefixes and overlaps of traces (Q1815323) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- Equidivisible Kleene monoids and the Elgot-Mezei theorem (Q1825971) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Extended Watson-Crick L Systems with Regular Trigger Languages (Q3007718) (← links)
- (Q3336723) (← links)
- Complete subgraphs of bipartite graphs and applications to trace languages (Q3479529) (← links)
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS (Q3502750) (← links)
- WORD EQUATIONS OVER GRAPH PRODUCTS (Q3521473) (← links)
- (Q4807831) (← links)
- Logical definability of some rational trace languages (Q4850330) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- Subclasses of recognizable trace languages (Q5096371) (← links)
- Toward a Structure Theory of Regular Infinitary Trace Languages (Q5167833) (← links)
- Reordering Derivatives of Trace Closures of Regular Languages. (Q5875402) (← links)
