Pages that link to "Item:Q1237361"
From MaRDI portal
The following pages link to A recursive and a grammatical characterization of the exponential-time languages (Q1237361):
Displaying 4 items.
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- Machine-independent description of certain machine complexity classes (Q1168310) (← links)
- Some formal results about stratificational grammars and their relevance to linguistics (Q3968471) (← links)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\) (Q6560166) (← links)
