The following pages link to Formal languages and enumeration (Q1259601):
Displaying 17 items.
- Random generation of words in an algebraic language in linear binary space (Q673672) (← links)
- Context-free grammars, differential operators and formal power series (Q688685) (← links)
- Two short proofs of Kemp's identity for rooted plane trees (Q802559) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- Enumeration of compositions with prescribed parts (Q1051638) (← links)
- Perron-Frobenius theory of some algebraic equations associated with context free grammars (Q1076108) (← links)
- Applications of the theory of automata in enumeration (Q1122575) (← links)
- A combinatorial interpretation for two transformations of series that commute with compositional inversion (Q1132879) (← links)
- Operatorenkalkül über freien Monoiden I: Strukturen (Q1146182) (← links)
- Enumeration d'arbres et formules d'inversion de séries formelles (Q1155056) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Attribute grammars are useful for combinatorics (Q1194317) (← links)
- Lattice path enumeration by formal schema (Q1197397) (← links)
- Enumeration of skew Ferrers diagrams and basic Bessel functions (Q1209643) (← links)
- On pairs of non-crossing generalized Dyck paths (Q1209653) (← links)
- Underdiagonal lattice paths with unrestricted steps (Q1283795) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
