scientific article; zbMATH DE number 3829284

zbMATH Open0523.68068MaRDI QIDQ3674080FDOQ3674080

Joaquim Gabarró

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

context-free languagescomplexity measure for languagesautomata recognizing approximations of a languageon-line multicounter Turing-machinesPetri-net languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Asymptotical behaviour of some non-uniform measures
• On the degrees of non-regularity and non-context-freeness
• On the Degree of Extension of Some Models Defining Non-Regular Languages
• Nonuniform complexity classes specified by lower and upper bounds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674080)