I can build a finite automation from a dataset and would be glad to expand that to a deterministic finite automation (DFA). A DFA requires accepting states. How one can identify them, or how these can be defined?
Is there any proper definition for accepting states? What is the difference of accepting states from all other states?
After processing a string in your language as input, your deterministic finite automaton should end processing in an accepting state. On the other hand, after processing a string not in your language as input, your deterministic finite automaton should not end processing in an accepting state. You should choose your accepting states such that these two conditions hold for all the strings in your language.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 10 months ago.
Improve this question
One of the biggest struggle with ML research is the creation of objective functions which capture the researcher's goals. Especially when talking about generalizable AI, the definition of the objective function is very tricky.
This excellent paper for instance attempts to define an objective function to reward an agent's curiosity.
If we could measure intelligent behavior well, it would perhaps be possible to perform an optimization in which the parameters of a simulation such as a cellular automaton are optimized to maximize the emergence of increasingly intelligent behavior.
I vaguely remember having come across a group of cross-discipline researchers who were attempting to use the information theory concept of entropy to measure intelligent behavior but cannot find any resources about it now. So is there a scientific field dedicated to the quantification of intelligent behavior?
The field is called Integrated Information Theory, initially proposed by Giulio Tononi. It attempts to quantify consciousness of systems by formally defining formally the phenomenological experience of consciousness, and computing a value Phi, meant for a proxy of "consciousness".
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 1 year ago.
Improve this question
Am doing a project which is about thermal management of the 18650 lithium-ion pack. I am currently simulating the model under natural convection. But I am supposed to run under forced convection. How/ where can we find forced convection in Dymola
You can use Modelica.Thermal.HeatTransfer.Components.Convection but you have to provide a value/equation for the thermal conductance Gc using a correlation from a textbook that fits the flow situation e.g. flow around / along a cylinder.
Closed. This question is not about programming or software development. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 6 months ago.
Improve this question
I'm learning the formal language and the theory of computation,
and new in draw finite automata.
So I want to ask how to draw FA or NFA for:
b*(ab) * a*
The simplified automaton is this one:
Where 1 is the starting state and all states are accepting states. It needs to be completed with a "Trash" state where all missing transitions will go.
Here I just drew a simple understandable NFA To demonstrate the solution for the given question
Image 1
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
I was reading about the flyweight design pattern on this page.
I was not able to understand the meaning of the "granularity" in the context of programming languages or the design pattern.
Can anyone please explain, an example would be great.
Granularity is a level of details. Granular objects are those, which are at low level detail in your program. Consider:
trees in game landscape
characters in document
seats in cinema
power points in cad application
Usually you have many granular objects in application. If you will create separate object for each tree/character/seat/power-point it could be very memory-consuming. Thats the problem which is solved by Flyweight pattern.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 11 years ago.
Improve this question
I'm wondering about functional or non-functional requirements. I have found lot of different definitions for those terms and I can't assign some of my requirement to proper category.
I'm wondering about requirements that aren't connected with some action or have some additional conditions, for example:
On the list of selected devices, device can be repeated.
Database must contain at least 100 items
Currency of some value must be in USD dollar.
Device must have a name and power consumption value in Watts.
are those requirements functional or non-functional ?
Functional requirements are things the system does.
Non-functional requirements are quality attributes or aspects of how the system is designed, built or implemented.
Have a look at:
https://softwareengineering.stackexchange.com/questions/71621/what-is-the-difference-between-a-non-functional-requirement-and-a-quality-attrib