A contect-free language and enumeration problems on infinite trees and digraphs

DOI10.1016/0095-8956(71)90073-6zbMath0211.02001OpenAlexW2090142443MaRDI QIDQ2543982

Werner Kuich

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(71)90073-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Algebraic languages and polyominoes enumeration ⋮ The complexity of computing the number of strings of given length in context-free languages ⋮ An approach to improving the Mayeda method for graph realization from a matrix ⋮ Classes of formal grammars ⋮ Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives

Cites Work

• Unnamed Item
• The numbers of labeled colored and chromatic trees
• Über Unterbäume eines Baumes
• A note on the enumeration of line chromatic trees
• On the entropy of context-free languages

This page was built for publication: A contect-free language and enumeration problems on infinite trees and digraphs