The following pages link to (Q5679727):
Displayed 14 items.
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
- Asymptotic approximation by regular languages (Q831785) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- A note on the density of inherently ambiguous context-free languages (Q1143178) (← links)
- On the number of words in the language \(\{w \epsilon \Sigma^* | w=w^ r\}^ 2\) (Q1164437) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- (Q4127408) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de (Q4923560) (← links)
- (Q5013886) (← links)
- (Q5015284) (← links)
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations (Q5164858) (← links)