scientific article; zbMATH DE number 3640909

MaRDI QIDQ4199562zbMATH OpenFDO

Authors J. Hartmanis

Publication date 1979

zbMATH Keywords

context-free languagesfinite automatalanguage representationpushdown automatarelative succinctness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(7)

• Concise description of finite languages
• Boolean kernels of context-free languages
• On reducing the number of stack symbols in a PDA
• A framework for polynomial-time query learnability
• On the undecidability and descriptional complexity of synchronized regular expressions
• Real-time pattern generation by one-dimensional cellular automata
• Kernels of context-free languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199562)