Deciding bisimilarity of normed context-free processes is in Σp2

Introduction to automata theory, languages and computation

Mathematics and Computers in Simulation · 1981 · 10.8K citations

Logical Automaton, Engineering, Automated Reasoning +5

Introduction to automata theory, languages, and computation

Computer Languages · 1980 · 6.8K citations

Logical Automaton, Engineering, Automated Reasoning +5

Communication and concurrency

Wojciech Penczek · Science of Computer Programming · 1990 · 4K citations

Engineering, Concurrency Theory, Concurrency (Computer Science) +5

The polynomial-time hierarchy

Larry J. Stockmeyer · Theoretical Computer Science · 1976 · 1.3K citations

Computational Complexity Theory, Engineering, Automated Reasoning +7

Introduction to formal language theory

Computer Languages · 1980 · 1.3K citations

Syntax, Formal Language Theory, Formal Language +8