Pages that link to "Item:Q3753510"
From MaRDI portal
The following pages link to Trace languages defined by regular string languages (Q3753510):
Displaying 14 items.
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← links)
- Traces, dependency graphs and DNLC grammars (Q1081307) (← links)
- On regular trace languages (Q1097040) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- Theory of traces (Q1107296) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- On the decidability of the equivalence problem for partially commutative rational power series (Q1193904) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (Q2799159) (← links)
- Complete subgraphs of bipartite graphs and applications to trace languages (Q3479529) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- On the structure of recognizable languages of dependence graphs (Q5286052) (← links)
- Reordering Derivatives of Trace Closures of Regular Languages. (Q5875402) (← links)