scientific article; zbMATH DE number 805390
From MaRDI portal
Publication:4851834
zbMath0847.68065MaRDI QIDQ4851834
John E. Hopcrofts, Jeffrey D. Ullman
Publication date: 12 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)
Related Items
A BDD SAT solver for satisfiability testing: An industrial case study, Inference and learning with hierarchical shape models, Unnamed Item, The weighted grammar constraint, The Differential Analysis of S-Functions, On decidability and closure properties of language classes with respect to bio-operations, On the overlap assembly of strings and languages, Unary Self-verifying Symmetric Difference Automata, LALR(1,1) parser generation for regular right part grammars, Complexity of the scheduling language RSV
