Computability, Complexity, and Languages

Martin Davis, R. S., & Weyuker, E. J. (1994). Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science. Morgan Kaufmann.

Type

Book

Intellectual base

Textbook

Year

1994

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Context-sensitive grammar
  • … start symbol, production form and context, noncontracting condition and empty-word exception, derivation relation, generated language and equivalence to linear-bounded automata are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

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:bb1ba6db4028 · see in the full table