scientific article; zbMATH DE number 3640909

zbMATH Open0412.68076MaRDI QIDQ4199562FDOQ4199562

Authors: J. Hartmanis 

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

context-free languagesfinite automatapushdown automatalanguage representationrelative succinctness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• A framework for polynomial-time query learnability
• Boolean kernels of context-free languages
• On reducing the number of stack symbols in a PDA
• On the undecidability and descriptional complexity of synchronized regular expressions
• Concise description of finite 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)