scientific article
From MaRDI portal
Publication:3674080
zbMath0523.68068MaRDI QIDQ3674080
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
context-free languagescomplexity measure for languagesautomata recognizing approximations of a languageon-line multicounter Turing-machinesPetri-net languages
Related Items (4)
On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Asymptotical behaviour of some non-uniform measures ⋮ On the degrees of non-regularity and non-context-freeness ⋮ Nonuniform complexity classes specified by lower and upper bounds
This page was built for publication:
