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
0
votes
1 answer

Confused about this NFA sentence

What does "In these situations the thread of the NFA's existence corresponding to those states simply dies" mean in my textbook?
Computer Knight
  • 29
  • 2
0
votes
1 answer

How can I do this in a smarter way without conflict?

In this way, it is returning some errors and it seems that the main examples are the characters of 2 characters, eg "++" being replaced by "# ++ #" while being close to replacing All () "to" ## + ## + ## ". return lexeme.replaceAll( "==",…
Igor Nunes
  • 1
  • 1
0
votes
1 answer

Let Σ = { a; b} How can I define a PDA in JFLAP which recognizes the following?

L = {a^n b^k | 2n >= k} For example.: abb is element of L, aabbb is element of L, ε is element of L, but babbb is not element of L, abbb is not element of L
Viktor
  • 59
  • 8
0
votes
3 answers

How do you detect a pattern match when comparing two unique strings?

I'm looking for a solution to the following string pattern matching problem. You've got a function that takes two arguments: pattern, and input - both are strings. Let's say pattern: aabbaa and input: catcatdogdogcatcat These specific arguments…
zero_cool
  • 3,960
  • 5
  • 39
  • 54
0
votes
0 answers

Computer science. Need explanation about asynchronous IO automaton

I'm currently reading Nancy Lynch book about distributed systems, chapter about IO automaton. And I have following questions related to book exercise 8.13(c). We are given some automaton A with sig(A) is empty. Traces(P) is the set of sequences over…
Sharov
  • 458
  • 8
  • 38
0
votes
1 answer

OpenMP in Biham-Middleton-Levine BML model

I've got a serial version of BML and I'm trying to write a parallel one with OpenMP. Basically my code works with a main witin a loop calling two functions for horizontal and vertical moves. Like that: for (s = 0; s < nmovss; s++) { …
glc78
  • 439
  • 1
  • 8
  • 20
0
votes
2 answers

how to convert a DFA to a regular expression?

I am reading the book: introduction to the theory of computation and got stuck on this example. Convert a DFA to an equivalent expression by converting it first to a GNFA(generalized nondeterministic finite automaton) and then convert GNFA to a…
Blackgirl5
  • 1
  • 6
0
votes
1 answer

Proof semidecidable languages

I have to proof "Semidecidable languages are closed by the direct morphism operation" I think that a direct morphism from E to F is a pair of morphisms s: E -> F, p: F->E, with p · s = IdE. So my porposal is make a proof with Turing Machines because…
Andrew Fells
  • 89
  • 8
0
votes
1 answer

How can I check if my line matches the NFA?

I made NFA that makes from regular expressions 3d array, for example (01*) expression. I get it: [[FROM,TO,TRANSITION]] [['q0', 'q1', '0'], ['q1', 'q2', ':e:'] ,['q1', 'q4', ':e:'] , ['q2', 'q3', '1'], ['q3', 'q2', ':e:'], ['q3', 'q4',…
Eywa
  • 41
  • 1
  • 6
0
votes
2 answers

How can I make DFA of the following condition?

Please help me to make the DFA of the following condition: L = { w: na(w) mod 3 > nb(w) mod 3 }, where na(w) represents the number of occurrences of a in w and nb(w) represents the number of occurrences of b in w.
Abdul Moiz Lakhani
  • 11
  • 6
0
votes
0 answers

Deterministic finite automaton (DFA)

Someone can help me to find the DFA for the language L:
ismail096
  • 1
0
votes
0 answers

Distributed Sliding Window in Java

How would you design a distributed sliding window algorithm in Java? I have an automaton for pattern detection. It is either in accepting state or invalidates. Say the pattern I'm looking for is age: 20 followed by age: 30. The pattern is a…
user5081242
  • 11
  • 4
0
votes
1 answer

Is useful the pushdown automaton in this case?

In the university they ask me for use grammar and Pushdown automaton to check the syntax of a portion of Java code. Due i have not used this automaton before, i have learnt a bit about how they work and i think that this automaton is not very…
vanillaHoman
  • 9
  • 5
0
votes
1 answer

I have to parse a complicated string format. Is implementing an automaton a sensible approach?

I am currently struggling with a particularly obnoxious string format that I have to parse. The strings can contain substrings that denote a variable property that has to be resolved. Imagine something like…
Hatch
  • 595
  • 2
  • 9
  • 18
0
votes
1 answer

The way to use JFLAP to do a Pushdown Automaton

I need to create a Pushdown Automaton with JFLAP that recognizes the following language: What steps need to be taken to do it? And how does it work?
deibbs
  • 24
  • 7
1 2 3
…
8 9