Stack Overflow
Stack Overflow

Questions tagged [automata]

In theoretical computer science, automata theory is the study of abstract 'mathematical' machines or systems and the computational problems that can be solved using these machines. These abstract machines are called automata. ("Automata", Wikipedia)

From Wikipedia,

Automata, or automata theory, is the study of mathematical objects called abstract machines or automata and the computational problems that can be solved using them. Automata comes from the Greek word αὐτόματα meaning "self-acting".

692 questions
-1
votes
1 answer

Writing the production rules of this finite state machine

Consider the following state diagram which accepts the alphabet {0,1} and accepts if the input string has two consecutive 0's or 1's: 01001 --> Accept 101 --> Reject How would I write the production rules to show this? Is it just: D -> C0 | B1 |…
David542
  • 104,438
  • 178
  • 489
  • 842
-1
votes
1 answer

How to construct DFA that L accept : w contain '110' and doesn't contain '010'?

L = { w belongs {0,1}* | w contain '110' and doesn't contain '010'} I need to construct DFA that receives L. How can I draw a DFA that will do the both of conditions? hints will be a great help.
AndrewM
  • 55
  • 7
-1
votes
1 answer

L={aʲbᵏaˡ | l = j * k} Context free? Recursive?

I have to classify the language L={aˆjbˆkaˆl | l = j * k}. I applied the pumping lemma for CFL and think that it is not context free. However, to prove that it is in fact recursive or recursively enumerable, would I have to be able to construct a…
nTn
  • 11
  • 1
-1
votes
1 answer

Does aabbabb belong to the regular expression ((a*| b*)bb)*?

I'm just curious if ((a*| b*)bb)* means that whatever number of a's or b's used in the inner parentheses must be fixed. Like if I had aabb, I could not follow it with a different number of a's? ` Would something like abbaabb or a bbbabb or bbbaaabb…
Shisui
  • 1,051
  • 1
  • 8
  • 23
-1
votes
1 answer

Conversion of RE to FSA without ε

i have a reguler expresion 10+(0+11)*1 how to change the reguler expression to Finite State Automata ?
Ardhika Yoviyanto
  • 1
  • 1
-1
votes
1 answer

Expression for this language

A language to generate all strings that have more a's than b's (not necessarily only one more, as with the nonterminal A for the language EQUAL, but any number more a's than b's).
Emma Harris
  • 9
-1
votes
1 answer

Evaluating Polish Notation in Java with 2 stacks

I am writing an evaluation code for polish notation. When I overcome ClassCastException I get EmptyStack and when I solve Emptystack I get ClassCast I'm in a loop. Here is how I wanted to evaluate the Polish notation: First I get a string from the…
Selçuk Başaran
  • 19
  • 7
-1
votes
1 answer

Find the regular expressions of the following?Language of odd length and cannot contain length multiple of 3 over ={,}

Language of odd length and cannot contain length multiple of 3 over ={,}
Muhammad Usman
  • 7
  • 2
-1
votes
1 answer

Making NFA of Regex ^[a-zA-Z0-9]{3,16}$

I'm trying to make a NFA of regex ^[a-zA-Z0-9]{3,16}$. I've understood that this regex means the language will only accept strings of length 3 to 16 which may include a to z, A to Z or 0 to 9. I've tried to make this but the main issue I'm facing…
Arbaz Khan
  • 23
  • 3
-1
votes
1 answer

How to find out the language that accepted by below NPDA

I wanna understand how find the language that will be accepted by below NPDA. M = {Q, Σ, Τ, δ, q0, z, F} Q is a set of state: {q0, q1, q2} Σ is alphabet: {a, b} Τ is stack alphabet: {0, 1, z} δ is transition function z is stack start symbol F is set…
Rurou2
  • 167
  • 1
  • 1
  • 7
-1
votes
2 answers

Best data structure & packages to represent geometric units on a grid

I want to write a program with 'geometry automata'. I'd like it to be a companion to a book on artistic designs. There will be different units, like the 'four petal unit' and 'six petal unit' shown below, and users and choose rulesets to draw unique…
Flying Spaghetti
  • 51
  • 5
-1
votes
1 answer

Designing a DFA

I want to design a DFA for the following language after fixing ambiguity. I thought and tried a lot but couldn't get a proper answer. S->aA|aB|lambda A->aA|aS B->bB|aB|b
Davood
  • 72
  • 8
-1
votes
2 answers

If M is a turing machine, the question if L(M) = A Regular Language, Decidable?

If M is a turing machine, we can construct a Context Sensitive Grammar G, and then check if the context sensitive grammar is context free, and finally context free grammar is regular or not in a way as described. If A Context sensitive grammar G is…
Puneet Singh
  • 23
  • 1
  • 3
-1
votes
1 answer

Automatic clicking on java program buttons

So I need to automate some button clickings on a java program. I tried ahks/autoit's controlclick but it doesn't really work (normal clicks do work, but I require no mouse movement). I tried to get some information from window detective / window…
Gonzalo Tuñez
  • 65
  • 1
  • 9
-1
votes
1 answer

I need help on proves about automata

Prove or disprove the following statements about the set of languages decided by each of the automata: 1) DPDA ⊆ 2-stack DPDA 2) 2-stack DPDA ⊆ DPDA 3) NPDA ⊆ 2-stack DPDA 4) 2-stack DPDA ⊆ NPDA
Moe
  • 65
  • 6
1 2 3
…
46 47