Size complexity in context-free grammars forms

DOI10.1145/321978.321980zbMath0333.68057OpenAlexW2001447498MaRDI QIDQ4099227

Seymour Ginsburg, Nancy A. Lynch

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321978.321980

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (3)

Concise description of finite languages ⋮ A pushdown automaton or a context-free grammar - which is more economical? ⋮ Pushdown acceptor forms

This page was built for publication: Size complexity in context-free grammars forms