Nezara
Nezara is a genus of plant-feeding stink bug of the family Pentatomidae.
| Nezara | |
|---|---|
 | |
| Nezara viridula f. torquata | |
Scientific classification  | |
| Kingdom: | Animalia |
| Phylum: | Arthropoda |
| Class: | Insecta |
| Order: | Hemiptera |
| Superfamily: | Pentatomoidea |
| Family: | Pentatomidae |
| Subfamily: | Pentatominae |
| Tribe: | Nezarini |
| Genus: | Nezara Amyot & Serville, 1843 |
Species
- Nezara antennata Scott, 1874
- Nezara capicola (Westwood, 1837)
- Nezara griseipennis Ellenrieder, 1862
- Nezara icterica Horváth, 1889
- Nezara immaculata Freeman, 1940
- Nezara indica Azim & Shafee, 1979
- †Nezara latitesta Theobald, 1937
- Nezara mendax Breddin, 1908
- Nezara naspirus (Dallas, 1851)
- Nezara niamensis (Distant, 1890)
- Nezara nigromaculata Distant, 1902
- Nezara orbiculata Distant, 1890
- Nezara paradoxus Cachan, 1952
- Nezara pulchricornis Breddin, 1903
- Nezara raropunctata Ellenrieder, 1862
- Nezara robusta Distant, 1898
- Nezara similis Freeman, 1940
- Nezara soror Schouteden, 1905
- Nezara subrotunda Breddin, 1908
- Nezara viridula (Linnaeus, 1758) – Southern Green Shieldbug
- Nezara yunnana Zheng, 1982
gollark: Many higher-level languages don't specify stuff like that, making them at least abstractly Turing-complete, but assembly/machine code languages *do*.
gollark: Okay.
gollark: This isn't a paradox. It can't simulate arbitrarily large CGoL grids.
gollark: Nope! Many languages, abstractly speaking, *don't* have limited memory. Their implementations might, though.
gollark: No, Turing completeness means it can simulate any Turing machine. It *can't* do that if it has limited memory.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.