The following pages link to (Q3336723):
Displaying 10 items.
- On bounded rational trace languages (Q970110) (← links)
- Efficient recognition of trace languages defined by repeat-until loops (Q989291) (← links)
- On the decidability of some problems about rational subsets of free partially commutative monoids (Q1099641) (← links)
- Theory of traces (Q1107296) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- Number of prefixes in trace monoids: clique polynomials and dependency graphs (Q2106610) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- (Q4807831) (← links)
- Subclasses of recognizable trace languages (Q5096371) (← links)