Pages that link to "Item:Q2543982"

The following pages link to A contect-free language and enumeration problems on infinite trees and digraphs (Q2543982):

Displayed 5 items.

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