Pages that link to "Item:Q3533023"

The following pages link to Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023):

Displaying 9 items.

• A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
• Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
• Methods for the estimation of the size of lookahead tree state-space (Q2393146) (← links)
• Prefixes of the Fibonacci word that end with a cube (Q2681077) (← links)
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (Q3073627) (← links)
• The binomial equivalence classes of finite words (Q4970534) (← links)
• A New Hierarchy for Automaton Semigroups (Q5859663) (← links)
• Ideals of equations for elements in a free group and context-free languages (Q6054798) (← links)