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
0
votes
1 answer

Type Variables in type classes

I have a strange question in relation to type classes. So you can define a basic type class like this: class Property x where checkThing :: x -> Int -> Bool transformThing :: x -> x If you want to have a type class with multiple parameters…
44701
  • 397
  • 4
  • 10
0
votes
1 answer

left regular grammar to nfa

I can convert a right regular grammar to an Non deterministic finite automata with the following algorithm: inputAlphabet = terminals grammar states = final + nonTerminals grammar startState = startSymbol grammar acceptStates =…
44701
  • 397
  • 4
  • 10
0
votes
0 answers

Draw deterministic automata

I need to draw deterministic automat for L={b^i a^j b^k c^ j where i,j,k >=1} and then prove that L=?L(A) however I have no idea how to start with this problem.
user5763976
  • 3
  • 1
0
votes
1 answer

Design a DFA for a string {0,1} which when reversed is decimal equivalent of 2 mod 7?

Design a DFA for a string {0,1} which when reversed is decimal equivalent of 2 mod 7?
Harshal Agrawal
  • 1
0
votes
1 answer

compliment of {a^n b^n c^n} in TOC

As we know the language {a^n b^n c^n} is not CFL for sigma={a,b,c}, then I am eager to know its complement. Will it be cfl ? Please let me know where I am wrong. According to me the compliment should be {a^i b^j c^k | i!=j or j != k} union…
GG123
  • 1
  • 5
0
votes
4 answers

How a^n b^n where n>=1 is not regular?

This is the simple finite automata I tried, what am I doing it wrong?
user
  • 53
  • 2
  • 7
0
votes
2 answers

Finite-state automation that accepts sum of digits divisible by n

Finite state machine that accepts if sum of digits divisible by 3 . I am trying to construct a finite state machine the accepts if the sum of digits is divisible by n. So far I was able to do for n=2 and n=3 but dint find any generalized steps that…
user5616894
  • 11
  • 2
0
votes
2 answers

Two Different Grammars Over One Set of Outputs

Can you give me 2 different grammars which outputs the same set of words? Illustration: Given a grammar A and B over the alphabet {0,1}, if grammar A can produce the word 0101001, grammar B could as well. If grammar B can produce 0101111 then…
neilmarion
  • 2,372
  • 7
  • 21
  • 36
0
votes
1 answer

Theory of Automata : Context Free Grammar

Please help me in making a CFG for this language. a^i b^j c^k where i
william
  • 3
  • 2
0
votes
1 answer

Communication between two state machines in Java

I've been using a simple eclipse plugin to create visual state machines, called statecharts, that also uses Java code to work. My overall goal is to make two state machines communicate with each other through sockets and exchange data and make…
Tina J
  • 4,983
  • 13
  • 59
  • 125
0
votes
2 answers

if L = P ∩ Q where P is Context Free Language(CFL) and Q is Regular then L is in?

The intersection of a context free language P with a regular language Q, is said to be always context free,but I still don't get why it is context free but not regular. The language generated by such an intersection has strings that are accepted…
akasharora107
  • 23
  • 5
0
votes
1 answer

Is a Pushdown Automaton with an Epsilon Transition a NDPA?

Let's suppose we have this PA: -> q0 (e, e -> $) --> q1 Where: q0 is a final and initial state; e is epsilon (empty); and q1 is another state. If the automaton were to read the e word, it could either make the transition to q1 or stop in q0. So,…
andre_ss6
  • 1,195
  • 1
  • 13
  • 34
0
votes
0 answers

Automata Homework Questions

Can anyone check these to see if I did them correctly. Thanks * Also I'm not sure on how to do number 8 if anyone can help me out that should be awesome.…
spatel
  • 21
  • 9
0
votes
0 answers

LR(1) Automata: difference between items

I have a doubt regarding the LR(1) automata construction: Is the state with the kernel [A->b., x] (state_1) equivalent to the state with the kernel [A->b.,x/y] (state_2)? Like, if I'm on the state [A->.b, x] and shift_b from this state, do I need to…
Frank
  • 241
  • 1
  • 2
  • 8
0
votes
1 answer

Automata and Formal Languages

Showing that the reverse of a word for a regular language L is also regular I am confused as to how I am to approach this question, i've been stuck for hours: For a word x, we use x^r to denote its reverse. For a language L, we use L^r to denote…
thecsmajor
  • 1
1 2 3
…
46 47