Introduction to Automata Theory, Languages, and Computation

John E. Hopcroft, J. D. U. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.

Type

Book

Intellectual base

Textbook

Year

1979

Link

no authoritative link yet

Cited by

2 citations across 2 artifacts.

Domain-specific

• Nested stack automaton
  • … and bottom markers, nested-store tree and active-stack rule, transition relation, create destroy and move operations, acceptance condition, determinism and recognized language class are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..
• Pairing function
  • Cantor’s polynomial pairing is one primitive-recursive example; injective encodings, bijections and computably invertible pairings must be distinguished.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:1a38e31d1532 · see in the full table