A finite automaton (FA) is a mathematical description of an algorithm capable of parsing regular languages. FAs have no external memory, and as such can only take into account a fixed number of previous symbols when processing strings. A deterministic FA (DFAs) is one for which there is only ever one legal transition between states; nondeterministic FAs can be transformed into equivalent DFAs. FAs are the weakest of the commonly-defined automata.
Questions tagged [finite-automata]
585 questions
3
votes
3 answers
Is Dead state is included in the Minimized DFA or not?
I searched google and in many pages it is given that in Minimized DFA dead state or trap state is removed. My question is how can it be still a DFA if some transition is undefined. So what you say people?
Prashant Bhardwaj
- 1,203
- 2
- 18
- 26
3
votes
2 answers
DFA minimization test suite?
I'm looking for a test suite of deterministic finite automata to be used for testing the correctness of DFA minimization algorithms. Could you give me some pointers? Or are there algorithms/implementations available that will generate such automata?…
ShyPerson
- 123
- 1
- 6
3
votes
1 answer
A square root computing turing machine
I think i am close to this answer but still to confirm can we create a turing machine(At least in Principle) which can work on real number computation and give exact results?**For example finding square root of an integer.(whose output would be a…
bashrc
- 4,725
- 1
- 22
- 49
3
votes
1 answer
How do regex engines account for irregularity?
My C is a bit shaky, but I've looked at python's source code and it looks like most of python's re module is implemented by state machines. This comes as no surprise since regular expressions can be reduced to deterministic finite state machines.
I…
Aillyn
- 23,354
- 24
- 59
- 84
3
votes
0 answers
JFLAP : Symbol for any character in lanugage
I'm beginner for Automata and JFLAP. I have action Finite Automata which tells that on any character in the language, it must go to another state. How am I implement this on JLAP.Thanks
SachiraChin
- 570
- 8
- 17
3
votes
2 answers
DFA string validation
I have a program that simply takes all the states as a set of states as a input.
And then the next input that is taken is the initial state among the set of states and then set of final states.
The next is a set of transition that I take among the…
Shridatt Zambodker
- 31
- 2
3
votes
2 answers
How can I prove this dFa is minimal?
I am trying prove that this DFA is minimal for this Union.
CS_student
- 31
- 1
3
votes
1 answer
How many equivalence classes in the RL relation for {w in {a, b}* | (#a(w) mod m) = ((#b(w)+1) mod m)}
How many equivalence classes in the RL relation for
{w in {a, b}* | (#a(w) mod m) = ((#b(w)+1) mod m)}
I am looking at a past test question which gives me the options
m(m+1)
2m
m^2
m^2+1
infinite
However, i claim that its m, and I came up with an…
Abraham Murciano Benzadon
- 1,424
- 13
- 27
3
votes
1 answer
Design a FA to accept L, where L = Strings in which ‘a’ always appears tripled
Design a FA to accept L, where L = {Strings in which ‘a’ always appears tripled} over the input set Σ = {a, b}.
This is my solution (A is start state):
From what I understand the question doesn't say it should always contain "a",
it should also…
Yad Hoshyar
- 43
- 7
3
votes
3 answers
Advantages/Disadvantages of NFA over DFA and vice versa
What are the relative pro's and con's of both DFA's and NFA's when compared to each other?
I know that DFA's are easier to implement than NFA's and that NFA's are slower to arrive at the accept state than DFA's but are there any other explicit, well…
user559142
- 12,279
- 49
- 116
- 179
3
votes
3 answers
Finite Automata string not ending with ba
Question: Build an FA that accepts only those words that do not end with ba.
I want to Draw DFA for this problem but I don't understand I to do it please help me to draw this
Muhammad Sami
- 520
- 2
- 8
- 21
3
votes
1 answer
Metaclasses configure classes. But can we configure metaclasses?
I discovered that the existence and use of metaclasses can save you from a lot code-writing by providing an elegant handle on the process of class creation. I use this in my application, where several interacting servers are instantiated. To…
achennu
- 1,538
- 1
- 13
- 18
3
votes
2 answers
Do reducers in Redux represent a FSA?
Recently I've been learning Redux and while reading the docs, I came across something called reducers.
According to the doc,
The reducer is a pure function that takes the previous state and an
action, and returns the next state.
i.e.…
Animesh Kumar
- 237
- 3
- 11
3
votes
6 answers
Can I implement State Transitions for a DFA in Java using java.util.Set
I'm implementing a DFA as close as I can to the formal definition as a learning exercise (and blogging material)
I planned on using a java.util.Set where a set is involved in the definition.
The definition involves a set of tuples to define the…
brabster
- 42,504
- 27
- 146
- 186
3
votes
1 answer
Defining a finite automata Coq
I am learning Coq and I'd like to use it to formalize Regular languages theory, specially finite automata. Let's say I have a structure for an automata as follows:
Record automata : Type := {
dfa_set_states : list state;
init_state :…
Erick Grilo
- 43
- 5