On Context-Free Languages and Push-Down Automata

Schützenberger, M. P. (1963). On Context-Free Languages and Push-Down Automata.

Type

Unclassified

Intellectual base

Unclassified

Year

1963

DOI

10.1016/s0019-9958(63)90306-1

Link

https://doi.org/10.1016/s0019-9958(63)90306-1

Cited by

1 citation across 1 artifact.

Domain-specific

• Deterministic context-free grammar
  • … deterministic pushdown automaton or equivalent parser condition, input and end marker, stack actions, determinism restriction, unambiguity consequence and strict-containment examples 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:fca03687a8bd · see in the full table