It doesn’t qualify for 2800 credit, but I’m wondering if I could take 3110 anyway. How hard a prerequisite for 3110 is 2800, if I’ve taken discrete math?
So I have a rather weird problem, I need to write predicates, without the use of any libraries other than built-in prolog predicates, that given a number N, accept a language such that:
Let alphabet A = a...z.
N = 5: accepts A*aAAAA. ie. when the letter a is 5th from the back.
N = 2: accepts A*aA. ie. when the letter a is 2nd from the back.
etc.
N = 3: rejects A*bAA. because a is not 3rd from the back.
I am trying to write an acceptor that will be able to accept this 'set' of languages based on N but the non-determinism is hurting my head since A can be a as well so I don't know how to handle this state change.
Any guidance in how this should approached would be very appreciated.
Hello everyone, am a computer science student, actually I'm working on a python library for simulating finite automata, on this library implemented DFA and NFA, and also is able to visualize the automata, convert NFA to DFA, and also implemented the product and union of DFA.
Here is my repo: https://github.com/rohaquinlop/automathon
and the PyPI page: https://pypi.org/project/automathon/
On the documentation you can see my email and my other media where you can contact me if you want, I'm making this library because I think that automata are really fun, and I want to help others when they are starting to learn about them.
I have the answer to this question here:
https://preview.redd.it/xkgtletm0rg71.png?width=1020&format=png&auto=webp&s=0551fefe70b2bea09455efe8faadf8940a1d3991
My answer is instead this (sorry for Paint!). I know it is incorrect but please could it be explained why it is incorrect? Is it because the question is asking for 'strings containing' and not exclusively that answer? Thank you so much!
https://preview.redd.it/hchrbapc1rg71.png?width=1004&format=png&auto=webp&s=6d072fdfa279cf3f84fbe9bde1727031dd81e014
Same as title.
Might be something simple but I'm not able to think of an answer.
A little help can go a long way.
I heard the word automata on a podcast and thought of googling it and found some YouTube lessons on it: https://youtu.be/Qa6csfkK7_I
How important is it?
In school I took an introduction to logic that ultimately ended in explanation of Finite State Automata. I liquidated a lot of those books since then but have been slowly revisiting some of the foundations of CS and was wondering if there were any suggested books on this subject?
**solved**
Hi Everyone,
Trying to self-study some CS related maths and it has been a nightmare doing so. I am attempting a question to design a NFA would appreciate it, if someone could verify my answer.
The question design criteria is the inputs can consist of (a, b) that are atleast 2 letters long and do not have the subword bb. The first and last letter has to be the same (so it can be aba or bab etc).
This is my solution:
https://preview.redd.it/gg69316iuwb61.jpg?width=2592&format=pjpg&auto=webp&s=d038e5fa7d9ad78632d9de5febb42da58b537d50
Hello Compsci community.
In University I enjoyed Automata Theory and Complexity Theory a lot, leading to a thesis somewhere between Game Theory, Automata Theory and Complexity Theory. I did not pursue this afterwards in my working life until I started to develop my own first game. Setting myself the challenge to use what I liked I released this puzzle application called "TrainAutomaton". The user solves puzzles close to the ones we did in Computer Science classes on NFAs / DFAs. I personally enjoyed the puzzly nature of the assignments a lot, but I also know that some of my fellow students did not.
Behind the scenes I have a NFA-like implementation that checks the players input (in the form of a railway grid) against the language (in the form of a list of train routes). Note that it is not a FA in the strict sense, as the automaton only checks the given words, which are either supposed to be in the set of words of the language or not. There is no expectation on the acceptance of words not on the task list, so it does not matter for most words, if the automaton accepts or rejects them.
I discarded the thought of implementing a Kleene Feature, as I felt it might be a bit confusing and unimmersive, but thats more of a game design question.
Here is a blog post on the first part of the automaton construction without the player input. https://nerdautomaton.com/2020/09/21/train-automaton-theory-pt1/
You can have a look at the it here, its free on Android and Windows PC.
https://www.youtube.com/watch?v=os_rMt6-uu0
If this game is useful to anyone in their classes or sparks some interest in computer sciences, let me know.
Hi all, I’m wondering if anyone who currently works in NLP or maybe more broad language technology uses FSTs in their work? I have a module in my linguistics MA which covers formal language and FSTs so I’m curious to see how/if anyone in the language technology industry actually uses them as part of their work. Thanks!
I have finished the section in Michael Sipser's intro to theory of computation on automata theory. Granted it's a short introduction but they never mention cellular automata and the those typical automata are nothing like the cellular kind.
The Wikipedia page for cellular automaton says they are studied in automata theory but the automata theory page and the finite state machine page does not mention cellular automata.
Perhaps Stephen wolframs book will explain better but before i finish that i was just wondering how you guys would describe this relationship?
I know it's right. When the character which is as the same as the first one in the pattern shows up, it will paste the next row of row0 to the next state. And when the one which is the same character as the second int the pattern… row1…..
https://www.geeksforgeeks.org/pattern-searching-set-5-efficient-constructtion-of-finite-automata/
Not sure if this is the right sub
I have to construct a regex and finite state automata for the language {a,b} where there is exactly 2 a's or 2b's although they are not necessarily adjacent. These are all the details i was given The regex i came up with was (a* b a* b a* + b* a b* a b*) I am not sure of how to convert this into FSA and im not sure if the regex is correct
In what other cases can this method of machine learning be used instead of "slow" Neural Nets?
Hi Everyone,
Trying to self-study some CS related maths and it has been a nightmare doing so. I am attempting a question to design a NFA would appreciate it, if someone could verify my answer.
The design criteria is that the inputs can consist of (a, b) that are atleast 2 letters long and do not have the subword bb. The first and last letter has to be the same (so it can be aba or bab etc).
This is my solution:
