The following pages link to Thin and slender languages (Q1897353):
Displayed 39 items.
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- Semi-synchronous transductions (Q1006891) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
- The single loop representations of regular languages (Q1383380) (← links)
- Length considerations in context-free languages (Q1391135) (← links)
- On images of D0L and DT0L power series. (Q1401199) (← links)
- On strongly context-free languages (Q1570831) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- On D0L power series (Q1575708) (← links)
- Min of Mat is not necessarily Mat (Q1606988) (← links)
- Succinct representations of languages by DFA with different levels of reliability (Q1763718) (← links)
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
- Decidability questions related to abstract numeration systems (Q1877679) (← links)
- Word-paired catenations of regular languages (Q1886339) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- Sparse and slender subsets of monoids. (Q2480765) (← links)
- Restricted use of the splicing operation<sup>1</sup> (Q2710743) (← links)
- The Critical Exponent is Computable for Automatic Sequences (Q2789533) (← links)
- FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION (Q2909182) (← links)
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES (Q3021987) (← links)
- ORTHOGONAL SHUFFLE ON TRAJECTORIES (Q3076614) (← links)
- Finite Automata, Palindromes, Powers, and Patterns (Q3540097) (← links)
- Language Decompositions, Primality, and Trajectory-Based Operations (Q3602796) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- RESULTS CONCERNING THINNESS OF D0L LANGUAGES (Q4786244) (← links)
- On differentiation functions, structure functions, and related languages of context-free grammars (Q4825398) (← 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)
- Numeration systems, linear recurrences, and regular sets (Q5204309) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- THE BASE PROBLEM FOR D0L PARIKH SETS (Q5291307) (← links)
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS (Q5704372) (← links)
- On Parikh slender context-free languages (Q5941095) (← links)
- One-dimensional pattern generation by cellular automata (Q6137186) (← links)
- On the multiplicity equivalence problem for context-free grammars (Q6183608) (← links)