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
0 answers

android: develop an app which automatically generate graph from regular expression

im a beginner and i want to build an android app that will generate a graph based on a regular expression(automata) but i dont know how to do it or what kind of tool should i use. im currently using android studio. thank you for your advance…
Christeine
  • 1
0
votes
1 answer

Automata regular Expression

I have this homework question. Which pair of regular expressions are equivalent? a) (ab)* and a*b* b) r(rr)* and (rr)*r c) r+ and r*r d) (b) and (c) I have been told that the answer is (d). I think (b) and (c) should also be answers. Can someone…
Riya kathil
  • 19
  • 4
0
votes
0 answers

Finding bug in a simple NPDA

I am told that this NPDA is wrong but I can't see why, could anyone spot the bug?
zetta
  • 49
  • 5
0
votes
1 answer

Automata - Construct NFA using copies of DFA - formal definition of NFA

I'm trying to learn how to solve the following exercise. I don't understand how to start, it's overwhelming. I do understand DFA's, NFA's and how to convert DFA's to NFA's. I also understand the formal notations. This is not a homework exercise,…
SJ19
  • 1,933
  • 6
  • 35
  • 68
0
votes
0 answers

Is it possible to have a production with one or more terminal(s) in the LHS of a recursively enumerable language?

As Recursively enumerable grammar is unrestricted, is it possible to have a production with one or more terminal(s) in the LHS (ie no non-terminals)?
Shardul
  • 90
  • 1
  • 9
0
votes
1 answer

Going from a language to a context free grammar

Given the language K = {e^h f^i | 2h > i > h} I need to generate a context free grammar Some production rules I came up with are: S -> eeTfff and T -> eTff | ϵ They only work when n = m + 1, but I don't know how to generate any rules for every…
sunnybool
  • 11
  • 1
0
votes
0 answers

If a timed automaton always terminates then there exists a trace with a maximum length?

Hi I have a theoretical question regarding timed automata and I would like to know if someone has already given an answer to it, since that would be usefull for my research. So my question is the following: Assume that you have a timed automaton…
Panos Vasilikos
  • 1
0
votes
1 answer

Automata on ruby

I have the following Automata class: class DFA attr_accessor :start, :end, :transition def initialize(options = {}) @start = options[:start] @end = options[:end] @transition = options[:transition] end def run(input) …
Anton Ostrouhhov
  • 591
  • 1
  • 4
  • 7
0
votes
1 answer

I'm trying to solve DFA

I have to do L1 U L2 and intersection L1 n L2
Omar Sameh
  • 11
  • 2
0
votes
1 answer

1 or 2 right hand side variable in Context free language

I have 2 questions to ask and I have some ideas about it also. 1) X-Context free grammer(X-CFG) with 1 terminal or variable at the right hand side of every rule. 2) Y-CFG with 2 terminal or variable at the right hand side of every…
MadMax
  • 306
  • 1
  • 5
  • 17
0
votes
1 answer

How to construct this turing machine?

How can we construct TMs such that it accepts(Give description only): a + b = c a . b = c Input is of the form a#b#c. a,b and c belongs to {0,1}* and are positive binary unsigned integers. I know that we can construct TMs if the input has unary…
chelsea
  • 185
  • 1
  • 10
0
votes
1 answer

Automata Simulator using Cytoscape JS

I am currently doing a research work which involves the development of a web-based simulator for Automata. I came across Cytoscape JS as a primary component in building our proposed simulator. I would like to ask if there some way that we can…
Daryl Ivan Empuerto Hisola
  • 13
  • 2
0
votes
1 answer

Generating grammar which contains all the alphabets

I need to construct a CFG for the language which can generate any phrase containing all symbols. S -> ABC A -> a,b,c,d.........z | B B -> .,?,-,=,.... | C C -> A | epsilon I think it's not right. is there anyway to make it work so it can generate…
Mohammad Zaheer
  • 1
0
votes
2 answers

How to run a fsm model forever

I am using python transitions module (link) to create finite state machine. How do I run this finite state machine forever? Bascically what I want is a fsm model which can stay "idle" when there is no more event to trigger. For examplel, in…
Yuanyuan Lu
  • 1
0
votes
0 answers

DFA of Binary numbers decimal equivalent divisible by some.number n

Hello we may construct DFA for binary equivalent decimal divisible by 3 for eg if we read a string 001 then first we read 0 and for next 0 we will shift towards left so it's 00 next if we read 1 00 will be left shifted and place 1 in 2^0 position so…
sri harsha
  • 23
  • 1
  • 8
1 2 3
…
46 47