Pages that link to "Item:Q672126"
From MaRDI portal
The following pages link to The expressiveness of a family of finite set languages (Q672126):
Displaying 10 items.
- The expressive power of the bounded-iteration construct (Q1186517) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- A query language for NC (Q1376409) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- On Families of Full Trios Containing Counter Machine Languages (Q2817390) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- A query language for NC (extended abstract) (Q6064297) (← links)