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

Constructing a Regular Expression from a Finite Automata

I'm trying to construct a regular expression from a Finite Automaton but found my self completely stuck with this one. The regex to use is like this: ? = 0 or 1 * = 0 or more += 1 or more | = or _ = empty string @ = empty set () = parentheses As I…
mjuopperi
  • 773
  • 7
  • 25
0
votes
1 answer

Transform NFA to DFA

I have simple example of NFA->DFA conversion, but I am confused about "q0,q1,q2" state. What is it for? Or maybe I have done something wrong? Here it is:
Lucas
  • 329
  • 1
  • 13
0
votes
1 answer

Is epsilon and empty set languages of NFA? (Nondeterministic Finite Automata)

I have a NFA like this: and the question is: Are epsilon and empty set languages of this NFA?
Lucas
  • 329
  • 1
  • 13
0
votes
1 answer

Space meaning in DFA?

This is a DFA generated by a tool for the regular expression (a|b)* abaabb (a|b)* What does space mean in the picture? And do you think it's completely correct because it doesn't show other possibilities for the string abaabb. e.g. what if if b in…
Square-root
  • 853
  • 1
  • 12
  • 25
0
votes
1 answer

Creating a automata where the length of the 0's in the automata are odd

Is this possible to create with a finite state machine? So like 101 is accepted because odd number of 0's but 1001 is rejected because even 0's 11 is not accepted because 0 is even. etc etc.
fsdff
  • 611
  • 4
  • 10
0
votes
0 answers

Compare numbers without deleting them - Turing machines

Is there a way to compare two binary numbers with a Turing machine without deleting them in the process?
Zap
  • 325
  • 1
  • 6
  • 23
0
votes
1 answer

Union of languages accepted by FSA's without epsilon transitions

I have been trying to formalise the union of two finite state automata without making use of epsilon transitions. I want to create a new initial start state for the new automata and from this new start state create transitions to the reachable…
Andre Croucher
  • 395
  • 1
  • 3
  • 9
0
votes
1 answer

Construct a grammar for a language

I have a question regarding this question: L= empty where the alphabet is {a,b} how to create a grammar for this ? how can be the production rule ? thanks in advance
Ejaz Ahamed
  • 31
  • 4
0
votes
1 answer

How to create a pushdown automata which accepts a language?

Can someone please explain to me how to create pushdown automata for this language. I don't understand the set notation for the language if you could explain that would be great too. Thank you
user5280872
0
votes
1 answer

Emptiness on weak alternating automata

I wanted to ask if there are algorithms (also already implemented) for checking emptiness of an alternating automaton in particular a weak alternating automaton.
kafka
  • 949
  • 12
  • 27
0
votes
1 answer

Why can't a N-State busy beaver keep going to the right?

I'm reading about Busy Beavers but if they have an infinite tape, why can't they keep infinitely printing 1's to the Right? Why do they have to keep going left and right
edd91
  • 185
  • 8
0
votes
0 answers

Pushdown automata stack states?

I am studying pushdown automata for a course and I've reached a conceptual plothole. Does the stack basically have infinite memory or only space for a single symbol? If I have the following string: abba And the following rules with q6 as my…
Callat
  • 2,928
  • 5
  • 30
  • 47
0
votes
0 answers

ocaml program doesnt display image when executed on cygwin terminal

I have written a program that writes an automaton's diagram from a list of nodes and edges in a dot file and opens it via the unix module in ocaml using imagemagick. It worked fine and it has opened the generated image when compiled and executed on…
user7450674
0
votes
1 answer

Reducing a DFA to a NFA

I am trying to figure out a problem where I must draw a NFA for a given language. The language is { w | the final five symbols of w include two a's and three b's }. I believe I have it as a DFA and am not sure if there is a more reduced version. If…
user4780686
0
votes
1 answer

How can I represent an automaton graphically from a list of int*char*int representing the transitions without using loops

I made a record called automaton containing the 5 fields required to represent an automaton I'm supposed to use graphics to represent every state and transition from the transitions list without using for or while loops only recursive…
user7450674
1 2 3
…
46 47