Stack Overflow
Stack Overflow

Questions tagged [automaton]

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.

130 questions
2
votes
1 answer

How to find the language of a NFA

As above, I have a transition graph, but I'm not sure how to find the language of it, seems to me that there are a lot of possibilities, but I must be misunderstanding somehow. My understanding is that any word that leads from the initial to the…
NotTooSmart13
  • 21
  • 2
2
votes
1 answer

I cannot seem to create a DFA for this language

{w∈{a,b}∗|w has baba as a substring} I am confused with this. How can I capture the following input for example? aaababa abbbaba ababbba ababaaaa It seems there must always be baba in either middle or start or end. I must decide whether to put it…
webiondev
  • 135
  • 1
  • 7
2
votes
1 answer

Formulation of language and regular expressions

I can't figure out what is the formal language and regular expression of this automaton : DFA automaton I know that the instance of 'b' or 'a' have to be even. At first I thought the language was: L = {(a^i)(b^j) | i(mod2) = j(mod2) = 0,…
Shelly875
  • 91
  • 8
2
votes
1 answer

Automaton DFA implementation not working using Java

I'm studying right now, at my university, DFA and NFA automatons and how to implement some of them using Java code. I am having some trouble with this exercise: we have 4 different laboratory turns (T1, T2, T3 and T4) and we need to write code in…
Federico
  • 415
  • 1
  • 3
  • 15
2
votes
1 answer

Implement a Cellular Automaton ? "Rule 110"

I was wondering how to use the Rule 110, with 55 lines and 14 cells. I have to then display that in an LED matrix display. Anyway my question is, how can I implement such automaton ?? I dont really know where to start, can someone please shed some…
NLed
  • 1,845
  • 14
  • 39
  • 68
2
votes
1 answer

PROLOG a particular finite-state-automaton

I can't find an answer for the following problem. The automaton accept strings like "A:5739." or "C::399\4342)", and these reminds me the path of the file system, but i am not sure about that. Problem text: Consider the following finite-state…
Fred_2
  • 249
  • 2
  • 11
2
votes
1 answer

Algorithm that checks if a context free grammar generates infinite language that a DFA rejects

I have a DFA A and a CFG G, then i have to check if G generates infinite words that A don't accept (rejected by A), and a nice complexity time. I thought to construct a graph with the CFG and if it contains a directed cycle, then produces an…
Jack Fenn
  • 45
  • 6
2
votes
1 answer

For a context free grammar, how do i convert it to an equivalent push down automaton?

For a context-free grammar G over Σ = {0, 1, 2}, with start variable S: S → 0S0 | 1S1 | 2S2 | Y Y → 22 How do i turn this into an equivalent Push-Down automaton
Billies Wesley
  • 437
  • 1
  • 6
  • 21
2
votes
1 answer

transition function of a automaton

My goal is to implement a transition function in OCaml which takes in input an state and a character is returns a positive Boolean formula(including true and false). That is: \delta(q0,a) = q1 and (q2 or q3) my problem is how to represent a…
kafka
  • 949
  • 12
  • 27
2
votes
2 answers

How can I programmatically identify evil regexes?

Is there an algorithm to determine whether a given JavaScript regex is vulnerable to ReDoS? The algorithm doesn't have to be perfect - some false positives and false negatives are acceptable. (I'm specifically interested in ECMA-262 regexes.)
fblundun
  • 987
  • 7
  • 19
2
votes
2 answers

What is a Suffix Automaton?

Can someone please explain to me what exactly is a suffix automaton, and how it works and differs from suffix trees and suffix arrays? I have already tried searching on the web but was not able to come across any clear comprehensive explanation. I…
KayEs
  • 135
  • 8
2
votes
1 answer

How to write this automaton

I am trying to solve some problems in An Introduction to Formal Languages and Automata, by Peter Linz. In Section 2.1 (Deterministic Finite Acceptors), I cannot write the automaton and need help to solve it. Question 17-(f), Chapter 2: L = {w :…
Jack Krauser
  • 61
  • 5
2
votes
2 answers

How Can I call a function, that is integrated in a type in Haskell?

I am student and in my programming course we have to learn Haskell. So I am new to it and i don't have that much experience. Also I am not familiar with posting questions in a forum. So first of all I will post the library, I have to work with. (DA…
0niveau
  • 23
  • 3
2
votes
2 answers

mathematica deterministic automaton

I want to make a module in mathematica that returns if an automaton is deterministic or not. I am considering that an automaton is not deterministic if there are 2 transitions that start at the same state and read the same simbol, or also if there…
tuket
  • 3,232
  • 1
  • 26
  • 41
2
votes
2 answers

Tool for drawing automaton

I am doing composition of two automaton (Actually it is a transducer). So at the of it, I want to visually represent it to analyze it. Which is the best tool/library for the same? People have suggested me dot and graphviz. Which is better? I am…
user1280282
  • 303
  • 4
  • 12
1 2
3
…
8 9