Pages that link to "Item:Q1346721"
From MaRDI portal
The following pages link to Rational and recognizable complex trace languages (Q1346721):
Displaying 13 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On bounded rational trace languages (Q970110) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- On projective and separable properties (Q1389766) (← links)
- (Q3976317) (← links)
- (Q4012243) (← links)
- (Q4281552) (← links)
- Subclasses of recognizable trace languages (Q5096371) (← links)
- Petri boxes and finite precedence (Q6162099) (← links)
- An algorithmic approach for checking closure properties of Ω-regular languages (Q6162107) (← links)
- Trace consistency and inevitability (Q6567776) (← links)