I'm given this deterministic finite automaton (DFA): I have to construct a regular expression for it. I do not understand one thing in the method described in my handbook. First of all, we have to ...

I have a school project where I have to use the library automata-lib to code a moore machine. I have the 9.0.0 version of the library, just like all my colleagues, but mine doesn't seem to have the ....

I'm working on a challenge involving a 3D (cubic) infinite cellular automata defined as: Initial State: We start with 8 cells positioned at the vertices of a cube and each cell is in one of 4 states {...

I am trying to parse a grammar of this type: g = """ S -> A{1} B{2}, S -> B{2} A{1} A -> A{1} A{2}, A -> A{2} A{1} B -> B{1} A{2}, B -> A{2} B{1} A -> a, A -> e ...

I am new to automata. I am currently designing an NFA over the language {a, b} that should accept strings where the number of as is odd. I have designed an NFA for this, but I think it's kind of like, ...

I am trying to install Spot on an Ubuntu 24.04 virtual machine following the official instructions provided in the "Installing the Debian packages" section of the Spot website. The ...

I've been dealing with problem 10 on Leetcode (Regular expression matching), where you are supposed to write a program that matches strings to a given regex.I wrote a solution in C that had passed 308 ...

A -> Aac | Ab | Bb | a B -> Ac | Ad | ϵ  Is this grammar LL(1)? Why so? If not, make it LL(1) I need help solving this. I think it's not LL(1) because it has left recursion but I don't know ...

I drew PDA diagram for this language but it still does not work. Can some please help me? My PDA accepts 'bc' which it should not. I have no idea to control the b and c of the language. My scala code ...

I'm trying to construct a DFA (binary only) that contains "11" or ends with "10". I tried to do the following: $q2$ and $q3$ are accepting states State 0 1 $q0$ $q0$ $q1$ $q1$ $q3$ ...

I am trying to write a regex to match strings with even instances of ab and ba with only the alphabet of {a,b}. I am trying to do so with only | and * operators. I think it has something to do with ...

In below array, the first glob is a subset of the second one: [ "HomePage/03-LocalDevelopmentBuild/public/**/*.@(js)", "HomePage/03-LocalDevelopmentBuild/**/*.@(js)" ] But how ...

I keep on struggling with how to actually capture the number of 0's . Do I use a different marker to capture 0 and 1? Or do I need to create new states that count the number of 0's? This doesn't seem ...

Find a finite automata that for the language L={0,1,2} with the following criteria: The word must contain "1002". The number of occurrences of 1 must be odd The number of occurrences of 2 ...

I am doing a problem where I am applying pumping lemma to the CFL L = {a^nb^nc^n : n >= 0}. Here is the start of a proof I was looking at: Assume L is a CFL, so there exists a pumping length p for ...