scientific article; zbMATH DE number 1178947
From MaRDI portal
Publication:4398765
zbMath0905.68085MaRDI QIDQ4398765
Publication date: 26 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityTuring machinesfinite automatacontext-free languagesregular languagespushdown automata
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
Unnamed Item ⋮ A language measure for supervisory control ⋮ Uniformly most powerful test with two-dimensional minimal sufficient statistic ⋮ On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion ⋮ Signed real measure of regular languages for discrete-event automata
This page was built for publication:
