31 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
0
votes
0
answers
28
views
NuSMV - Issue with counter-based signal activation in Model
I have a project for the Embedded System Design course where I need to model a fault-tolerant sensor reading mechanism. I have reduce the system to only the important parts. The system relies on error ...
0
votes
1
answer
257
views
DFA for input starting with "1", and having "11" in it. Why it doesn't accept this input?
I'm trying to make a Deterministic Finite Automaton (DFA) to accept binary strings that start with "1" and have a substring "11" in it, over {0,1}.
Here is the DFA I created:
...
0
votes
1
answer
78
views
How to create a singleton in Python that always replaces the previous instance?
I'm working on a game in pygame-ce as a hobby, for scene management I've implemented a finite state machine. The problem is, it currently only kind of works, as the scene object is not garbage ...
-1
votes
1
answer
235
views
Finite state machine with timer resets
I'll have a real world problem that I try to solve which involves the implementation of a FSM. But I fail to get it right.
My problem: I want to integrate my garage door into my smart home. As it is ...
1
vote
0
answers
29
views
On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition
I am going through hbka.pdf (WFST paper - https://cs.nyu.edu/~mohri/pub/hbka.pdf)
I am trying to understand this paragraph. Pg 22/31.
"The deterministic transducer composes without a matching ...
0
votes
1
answer
33
views
How does placing the output (word) labels on the initial transitions of the words in an FST lead to effective composition?
I am going through hbka.pdf (WFST paper). https://cs.nyu.edu/~mohri/pub/hbka.pdf
A WFST figure for reference
Here the input label i, the output label o, and weight w of a transition are marked on the ...
0
votes
1
answer
110
views
How to create a deterministic finite automata for the "regular" function where states lead to more than one state depending on the value of an int
the manual of Minizinc says that we can pass an array to the "regular" function that represent the transitions between states of a DFA. For this state machine:
It puts this example:
array[...
1
vote
1
answer
652
views
How to simplify/generalize a Finite State Machine (FSM) for a vending machine?
I have enrolled into course of computational methods, and currently we are reviewing automata and regular expressions. In one of the course assignments we were asked to design a finite state automata ...
user avatar
user19921500
0
votes
1
answer
278
views
Aligning nodes in dot with group does not give the desired result
I tried to create graph from here Improving graphviz layout and want to get the exact picture
like in post, but can't vertically align nodes and get nice curve in q3->q3. My question is about how ...
0
votes
1
answer
53
views
How do I set a pause between if statements?
I want to write a code that let’s a car drive if low light is detected and stop if a sonar sensor measures less than 20 cm. This has to be repeated. However, if the same low light is detected again ...
-1
votes
1
answer
338
views
Draw an FSA that recognizes: (A∗ | AB+). (The bar outscopes the other operators, so its equal to: (A∗) | (AB+).) Use as few states possible
I've attached what I have. My problem is that I don't know if its correct and if I've even used the fewest states possible to answer this question. Really appreciate any help on what I currently did ...
1
vote
0
answers
65
views
Detect cyclic feeding interactions without applying XFST replace rules to lexicon
The following two XFST replace rules represent a cyclic feeding interaction, where the final result includes the original form because the first rule feeds into the second and the second feeds into ...
1
vote
1
answer
120
views
Generate output based on first character of a word
I am trying to set up a Finite State Transducer with Helsinki Finite State Technology (HFST) for Python.
I want if the first character of a word is an 'o' the output is "Positive" and if ...
0
votes
0
answers
31
views
Given a finite character vocabulary, what is the easiest way to represent arbitrarily long sequences of characters with uniform length?
I am attempting to manipulate a finite state transducer for a project. However, in constructing the FST, I need the output symbols to each be some arbitrarily long sequence of characters from the ...
0
votes
1
answer
1k
views
Is this NFA correctly accepting inputs that end with a 00?
In a lecture it was said that this NFA accepts inputs ending with two zeros or inputs=0: https://ibb.co/9Wt0j7J .
The alphabet is {0,1}
But if the input would be 001 we would on some path also end up ...