An automaton is a mathematical object describing an abstract machine with a finite set of states and transitions between these that runs on sequences of inputs consisting of letters (or symbols) picked from an alphabet.
Questions tagged [automaton]
130 questions
0
votes
2 answers
Finite strings but possibly infinite language
We know that a string is finite but on the other hand we know that a language is a set of strings(possibly infinite) over an alphabet. Isn't this relation a contradiction?
SaJa
- 3
- 6
0
votes
1 answer
A finite automaton accept no string
How can a finite automaton over(0,1) doesn't accept any string? I only can think of
s->a->q->F
Where the final state F is empty set. Is that true please?
user4441082
- 371
- 1
- 5
- 21
0
votes
1 answer
How do find unique input and output for a finite state machine
How would I go about finding out whether each state has a unique input / output sequence? Is there a standardised technique or method? I can't seem to find anything online.
Thanks for any help!
user1686342
- 1,265
- 1
- 18
- 24
0
votes
1 answer
A pushdown automaton that recognizes the negation of a language
As an example:
Say I want to design a PDA that recognizes the language of all strings over the alphabet {1,0} that are NOT palindromes. If I design a PDA that recognizes the language of all strings over the {1,0} that are palindromes and then swap…
Charles Del Lar
- 85
- 2
- 6
0
votes
2 answers
NFA to DFA conversion = deterministic?
I am struggling a bit with the meaning of determinism and nondeterminism. I get the difference when it comes to automata, but I can't seem to find an answer for the following: Is a NFA to DFA transformation deterministic?
If multiple DFAs can be…
xrdty
- 886
- 2
- 10
- 22
0
votes
0 answers
Theory Language- What is the best way to convert a regular expression to an automata?
I have a question about how to convert a regular expression to aan automata? I hear about the Gluskov algorithm but i couldn't find a right document about it.
Example: i have an regular expression like (a*|b*) U (a*a|c*)* and i want to convert in a…
Itachi Uchiha
- 23
- 1
- 3
0
votes
1 answer
Understand the pumping lemma
I am relatively new to the pumping lemma, and I have a problem here that I think I answered correctly, can anyone tell me if this works and if not why not
The problem: {www | w is {a,b}*}
My approach:
L = www
u* (v^k) * w has to be a subset of L…
Guitardeon
- 73
- 1
- 7
0
votes
1 answer
Out of bounds issue in Python
Whilst programming Cellular-Automaton (obviously not finished) I encountered issues with bounds. The goal for the result of this section is to have a value in the position (i,j) on a matrix depicting the average of a random value (and its direct…
0
votes
0 answers
regular language pumping lemma for string with even 0's
find whether string with even number of zeros is a) context free b)regular
a) using pumping lemma for CFL....it can be represented as e(0n)e(0n)e. so , it's a CFL.
b) it can be represented as (00)* in regex. So, i think it's a regular language. But,…
claudius
- 1,112
- 1
- 10
- 23
0
votes
1 answer
Modelisation of an automaton with coq
i have a problem with definition of an automaton in coq proof assisstant, an error was shown when i create this code:
(*automate*)
Record automaton :Type:=
mk_auto {
states : Set;
actions :Set;
initial : states;
transitions : states ->…
NAAS1425
- 3
- 5
0
votes
1 answer
How would you prove an ordered language is regular?
I want to know how to prove a language that has order constraints is regular. For example if you had that Σ = {1,2,3,4,5} where L (a subset of Σ*) = (a1,a2,...an) such that an+1 was larger than an how would you prove that this is a regular…
Quanqai
- 647
- 1
- 5
- 10
0
votes
2 answers
Moving from state to state in this automaton via HashMap
I'm using this method to move from a state to the next on this automaton simulator:
public void processString (String string){
StringBuilder stepString= new StringBuilder (string);
int actualStateIntIndex;
System.out.println("THE FOUND…
andandandand
- 21,946
- 60
- 170
- 271
0
votes
1 answer
LR(0) Parser conflicts
I have a doubt about lr(0) parsers.
For example I have the follow grammar:
S -> S N
|
N -> terminalsymbol
If I try to construct the first state of lr0 automaton, I get the following first state:
S ' -> . S $
S -> . S N
S -> .
So here…
Afaria
- 403
- 5
- 14
0
votes
1 answer
Java: Indexoutofbound in Cellualar Automaton
Here is my code for a cellular automaton I am working on:
UPDATE:
public class Lif1ID {
private Rule rule;
private int stepCount;
public static void main (String [ ] args) {
Lif1ID simulation = new Lif1ID ( );
…
John Cheung
- 3
- 2
0
votes
2 answers
Java: Indexoutofrange what is going on?
Here is my code for a cellular automaton I am working on:
public class Life1D {
private Rule rule;
private int stepCount;
public static void main (String [ ] args) {
Life1D simulation = new Life1D ( );
…
