scientific article; zbMATH DE number 3553748

zbMath0355.68032MaRDI QIDQ4127379

B. A. Trakhtenbrot

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Word problems, etc. in computability and recursion theory (03D40) Turing machines and related notions (03D10) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Some remarks about the efficiency of polyautomata

This page was built for publication: