Noncounting Context-Free Languages
From MaRDI portal
Publication:4170261
DOI10.1145/322092.322098zbMath0388.68073OpenAlexW2049024278MaRDI QIDQ4170261
No author found.
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
Related Items
Inference of even linear grammars and its application to picture description languages, First-Order Logic Definability of Free Languages, Beyond operator-precedence grammars and languages, Identification of function distinguishable languages., Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages, Homomorphic characterization of tree languages based on comma-free encoding, Efficient learning of context-free grammars from positive structural examples, Operator precedence and the visibly pushdown property, Associative language descriptions, Inferring regular languages by merging nonterminals
