Noncounting Context-Free Languages
From MaRDI portal
Publication:4170261
DOI10.1145/322092.322098zbMath0388.68073MaRDI 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
68Q45: Formal languages and automata
Related Items
Associative language descriptions, 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, First-Order Logic Definability of Free Languages, Inferring regular languages by merging nonterminals