Publication:3687739
From MaRDI portal
zbMath0571.68058MaRDI QIDQ3687739
Publication date: 1985
68Q45: Formal languages and automata
Related Items
Non recursive functions have transcendental generating series, Properties of infinite words : Recent results, On a class of languages with holonomic generating functions, On the number of factors of Sturmian words, Asymptotic approximation by regular languages, The number of three-choice polygons, Prefixes of infinite words and ambiguous context-free languages, Ambiguity in omega context free languages, On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\), Why We Need Semirings in Automata Theory (Extended Abstract)