The following pages link to Star-free trace languages (Q1193878):
Displaying 16 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- A note on the commutative closure of star-free languages (Q672729) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Some decisional problems on rational relations (Q1390853) (← links)
- Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- Adaptive Star Grammars (Q3541949) (← links)
- Topology for Computations of Concurrent Automata (Q4354233) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- (Q5094152) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
- Languages and logical definability in concurrency monoids (Q6560171) (← links)
