Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Automata-based_programming> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Automata-based_programming abstract "Automata-based programming is a programming paradigm in which the program or its part is thought of as a model of a finite state machine (FSM) or any other (often more complicated) formal automaton (see automata theory). Sometimes a potentially-infinite set of possible states is introduced, and such a set can have a complicated structure, not just an enumeration.FSM-based programming is generally the same, but, formally speaking, doesn't cover all possible variants as FSM stands for finite state machine and automata-based programming doesn't necessarily employ FSMs in the strict sense.The following properties are key indicators for automata-based programming: The time period of the program's execution is clearly separated down to the steps of the automaton. Each of the steps is effectively an execution of a code section (same for all the steps), which has a single entry point. Such a section can be a function or other routine, or just a cycle body. The step section might be divided down to subsection to be executed depending on different states, although this is not necessary. Any communication between the steps is only possible via the explicitly noted set of variables named the state. Between any two steps, the program (or its part created using the automata-based technique) can not have implicit components of its state, such as local (stack) variables' values, return addresses, the current instruction pointer etc. That is, the state of the whole program, taken at any two moments of entering the step of the automaton, can only differ in the values of the variables being considered as the state of the automaton.The whole execution of the automata-based code is a (possibly explicit) cycle of the automaton's steps.Another reason to use the notion of automata-based programming is that the programmer's style of thinking about the program in this technique is very similar to the style of thinking used to solve math-related tasks using Turing machine, Markov algorithm etc.".
- Automata-based_programming wikiPageExternalLink paper.html.
- Automata-based_programming wikiPageExternalLink is.ifmo.ru.
- Automata-based_programming wikiPageExternalLink _book.pdf.
- Automata-based_programming wikiPageExternalLink index.html.
- Automata-based_programming wikiPageExternalLink Statecharts.pdf.
- Automata-based_programming wikiPageID "3377755".
- Automata-based_programming wikiPageRevisionID "642316026".
- Automata-based_programming hasPhotoCollection Automata-based_programming.
- Automata-based_programming subject Category:Programming_paradigms.
- Automata-based_programming type Abstraction100002137.
- Automata-based_programming type GrammaticalRelation113796779.
- Automata-based_programming type Inflection113803782.
- Automata-based_programming type LinguisticRelation113797142.
- Automata-based_programming type Paradigm113804375.
- Automata-based_programming type ProgrammingParadigms.
- Automata-based_programming type Relation100031921.
- Automata-based_programming comment "Automata-based programming is a programming paradigm in which the program or its part is thought of as a model of a finite state machine (FSM) or any other (often more complicated) formal automaton (see automata theory).".
- Automata-based_programming label "Automata-based programming".
- Automata-based_programming label "Programação orientada a autômatos".
- Automata-based_programming label "Автоматное программирование".
- Automata-based_programming sameAs Programação_orientada_a_autômatos.
- Automata-based_programming sameAs m.098fnh.
- Automata-based_programming sameAs Q4056322.
- Automata-based_programming sameAs Q4056322.
- Automata-based_programming sameAs Automata-based_programming.
- Automata-based_programming wasDerivedFrom Automata-based_programming?oldid=642316026.
- Automata-based_programming isPrimaryTopicOf Automata-based_programming.