Pages that link to "Item:Q5248980"
From MaRDI portal
The following pages link to RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980):
Displaying 7 items.
- Weighted operator precedence languages (Q2064530) (← links)
- Rational elements of summation semirings (Q2663048) (← links)
- UNAMBIGUOUS SHARED-MEMORY SYSTEMS (Q3586410) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- (Q3746904) (← links)
- (Q4535007) (← links)
- Representing any-time and program-iteration by infinitary conjunction (Q4583319) (← links)