Abstract Crop yield prediction is a crucial area in agriculture that has a large impact on the economy of a country. This article proposes a crop yield prediction framework based on Internet of Things and edge computing. We have used a fifth generation network device referred to as femtolet as the edge device. The femtolet is a small cell base station that has high storage and high processing ability. The sensor nodes collect the soil and environmental data, and then the collected data is sent to the femtolet through the microcontrollers. The femtolet retrieves the weather‐related data from the cloud, and then processes the sensor data and weather‐related data using Bi‐LSTM. The femtolet after processing the data sends the generated results to the cloud. The user can access the results from the cloud to predict the suitable crop for his/her land. This is observed that the suggested framework provides better accuracy, precision, recall, and F1‐score compared to the state‐of‐the‐art crop yield prediction frameworks. This is also demonstrated that the use of femtolet reduces the latency by ˜25% than the conventional edge‐cloud framework.

Pure 2D context-free grammar (P2DCFG) with an independent mode of array rewriting, was recently introduced and named as IP2DCFG. Here we consider a variant of IP2DCFG, called (l/u)IP2DCFG, by requiring rewriting of the leftmost (respy. uppermost) symbol in every row (respy. column) of an array, with the symbol having a rewriting rule in a given set of pure context-free rules. We introduce an array P system with (l/u)IP2DCFG kind of rules and array rewriting in its membranes. When two membranes are used in the array P system, the array generative power is increased compared to using a single membrane.

This paper investigates properties of words such that their Parikh q-matrices commute. For any two words [Formula: see text], the concept of q-weak ratio property between u and v is introduced. Based on this property a necessary and sufficient condition for the Parikh q-matrices of any two words over binary alphabet to commute is given. This paper also provides a special class of words over an arbitrary alphabet ∑ k such that their Parikh q-matrices commute.