Results 201 to 210 of about 29,808 (223)

Green tea catechins and prostate cancer: mechanisms, clinical evidence, and safety: a narrative review. [PDF]

BMC Cancer
Altinoz HB, Sanlier N.
europepmc   +1 more source

Tea bud pose estimation and grading detection network based on improved YOLOv7. [PDF]

Front Plant Sci
Yao Y, Gui Z, Liu H, Yang Z, Yao L, Li K, Lin Z, Mao Y, Jia Z, Li Y, Ma R.   +10 more
europepmc   +1 more source

Identification of non-glandular trichome hairs in cannabis using vision-based deep learning methods. [PDF]

J Forensic Sci
Zvirin A, Shapira A, Attal E, Gozlan T, Soussan A, De La Vega D, Harush Y, Kimmel R.   +7 more
europepmc   +1 more source

On a homomorphic characterization of the class of slender context-free languages (Languages, Algebra and Computer Systems)

On a homomorphic characterization of the class of slender context-free languages (Languages, Algebra and Computer Systems)
openaire  

A few notes on slender 0L Languages(Extended abstract)(Semigroups, Formal Languages and Combinatorics on Words)

A few notes on slender 0L Languages(Extended abstract)(Semigroups, Formal Languages and Combinatorics on Words)
openaire  

Some of the next articles are maybe not open access.

Related searches:

On a Hierarchy of Slender Languages Based on Control Sets

Fundamenta Informaticae, 1997
We study slender context-sensitive languages, i.e., those containing at most a constant number of words of each length. Recently, it was proved that every slender regular language can be described by a finite union of terms of the form uviw [9] and every slender context-free language can be described by a finite union of terms of the form uviwxiy [4 ...
Takeshi Koshiba
exaly   +3 more sources

On slender 0L languages over the binary alphabet

Acta Informatica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juha Honkala
exaly   +3 more sources

Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages

Lecture Notes in Computer Science, 2004
In this note we investigate the languages obtained by intersecting slender regular or context-free languages with the set of all primitive words over the common alphabet. We prove that these languages are also regular and, respectively, context-free. The statement does not hold anymore for either regular or context-free languages.
Carlos Martin-Vide, Víctor Mitrana
exaly   +2 more sources

SLENDER MATRIX LANGUAGES

Developments In Language Theory, 2000
exaly   +2 more sources