Noncounting Context-Free Languages

DOI10.1145/322092.322098MaRDI QIDQ4170261zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(10)

• Inference of even linear grammars and its application to picture description languages
• Efficient learning of context-free grammars from positive structural examples
• Identification of function distinguishable languages.
• Operator precedence and the visibly pushdown property
• Beyond operator-precedence grammars and languages
• Homomorphic characterization of tree languages based on comma-free encoding
• First-order logic definability of free languages
• Inferring regular languages by merging nonterminals
• Associative language descriptions
• Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages

This page was built for publication: Noncounting Context-Free Languages

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