Noncounting Context-Free Languages

From MaRDI portal

Revision as of 11:29, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4170261

Jump to:navigation, search

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4170261&oldid=17990180"