I designed Turing machine that accepts the input over the language: {a^i b^j | j is divisible by i, i ≥ 2, j ≥ 2} This Turing machine should accept and reject the stings as following: aabbbb | ...

I'm trying to implement some logic within a system of microcontroller IRQs and event callbacks, that fundamentally require the use of a complex state machine in order to behave correctly. Regular ...

I am trying to solve the following Turing machine challenge: The number choice function The number choice function is defined as follows. INPUT: a sequence 𝑘, 𝑥1, 𝑥2,..., 𝑥𝑛 where 𝑘 is a ...

When specifying required versions of a dependency in npm, we can specify ranges of versions. For example: 1.2.7 || >=1.2.9 <2.0.0 Specification: https://github.com/npm/node-semver?tab=readme-ov-...

I have a large set of data, 4000 rows+. each row is associated with metric data that is collected daily. Metric table is at over 1.1 million rows. for example: Item table: Id Item 1 Hello 2 World ... ....

I have this finite automata (FA) and want to write its language. I think its L={x E {0,1} | {x with subset of 00 and ends in 1} and it would help to know what the type of FA it is. I think it's a DFA ...

I recently stumbled upon an optimization problem while working on structural analysis. While I'm confident in my MATLAB skills as an aerospace engineer, I must admit my theoretical knowledge in ...

Just learned about DPDA's on my Theory of computation class. Professor gave us a semester task to create a deterministic pushdown automaton state diagram that is able to accept all strings multiples ...

How to find the grammar of this language: La = {ww^r: w e {0,1}^*, w ends with 1} ? r: is reverse Here is my solution: S -> 0S0|1S1| 0|1|E(epsilon) What can I change here or is the solution the ...

In this Puzzling SE post, there's a maze with infinitely nested inside itself. Inspired by this, consider the following graph problem: Setup: A graph G with vertices V and undirected edges E And ...

I am trying to solve this popular problem: "Given an integer array, divide the array into two subsets, A and B, while respecting the following conditions. the intersection of A and B is null. ...

I'm trying to solve this challenge: Design a DFA for all binary strings having an even number of 0's or containing exactly two 1's I'm a bit confused with this question. I had tried to come up with ...

The DFA for even numbers of and b is this DFA for even numbers of a and b but the DFA of even and equal number of a and b is not available L={\epsilon,aabb,abab,baba,bbaa,aaaabbbb,aabbaabb,bbaabbaa,...

I’m doing research on the models of computation and how they work and what they are. I would like someone To help me understand what these are and help me find books or anything to research them. I’...

Let FT be the class of all finite languages over {0,1}. Suppose FL is countable, so we can enumerate all members of FL as FL = {L_0, L_1, L_2, ...} Meanwhile, we also enumerate all strings over the ...