The following pages link to (Q3687739):
Displaying 10 items.
- On a class of languages with holonomic generating functions (Q728269) (← links)
- On the number of factors of Sturmian words (Q805261) (← links)
- Asymptotic approximation by regular languages (Q831785) (← links)
- The number of three-choice polygons (Q967948) (← links)
- Prefixes of infinite words and ambiguous context-free languages (Q1108044) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) (Q2399255) (← links)
- Why We Need Semirings in Automata Theory (Extended Abstract) (Q2947145) (← links)
- Non recursive functions have transcendental generating series (Q4732456) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
