The following pages link to (Q4714446):
Displaying 16 items.
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- On three variants of rewriting P systems (Q1399988) (← links)
- Gemmating P systems: Collapsing hierarchies. (Q1401271) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- Spiking neural P systems with multiple channels (Q2179075) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems (Q2566011) (← links)
- On the power and size of extended gemmating P systems (Q2576607) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- On Some Classes of Sequential Spiking Neural P Systems (Q5378353) (← links)
- Spiking Neural P Systems with a Generalized Use of Rules (Q5383813) (← links)
- Extended spiking neural P systems with white hole rules and their red-green variants (Q6061996) (← links)
