Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4056322> ?p ?o }
Showing triples 1 to 45 of
45
with 100 triples per page.
- Q4056322 subject Q13360530.
- Q4056322 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 mathmatical tasks using Turing machine, Markov algorithm etc.".
- Q4056322 wikiPageExternalLink Statecharts.pdf.
- Q4056322 wikiPageExternalLink paper.html.
- Q4056322 wikiPageExternalLink is.ifmo.ru.
- Q4056322 wikiPageExternalLink _book.pdf.
- Q4056322 wikiPageExternalLink index.html.
- Q4056322 wikiPageWikiLink Q1128903.
- Q4056322 wikiPageWikiLink Q1135914.
- Q4056322 wikiPageWikiLink Q1305241.
- Q4056322 wikiPageWikiLink Q132364.
- Q4056322 wikiPageWikiLink Q13360530.
- Q4056322 wikiPageWikiLink Q1437424.
- Q4056322 wikiPageWikiLink Q1524945.
- Q4056322 wikiPageWikiLink Q15777.
- Q4056322 wikiPageWikiLink Q163310.
- Q4056322 wikiPageWikiLink Q169411.
- Q4056322 wikiPageWikiLink Q16958879.
- Q4056322 wikiPageWikiLink Q176452.
- Q4056322 wikiPageWikiLink Q184199.
- Q4056322 wikiPageWikiLink Q187560.
- Q4056322 wikiPageWikiLink Q188267.
- Q4056322 wikiPageWikiLink Q189224.
- Q4056322 wikiPageWikiLink Q1900936.
- Q4056322 wikiPageWikiLink Q194152.
- Q4056322 wikiPageWikiLink Q214526.
- Q4056322 wikiPageWikiLink Q2303083.
- Q4056322 wikiPageWikiLink Q230866.
- Q4056322 wikiPageWikiLink Q230885.
- Q4056322 wikiPageWikiLink Q2407.
- Q4056322 wikiPageWikiLink Q2626418.
- Q4056322 wikiPageWikiLink Q275472.
- Q4056322 wikiPageWikiLink Q275596.
- Q4056322 wikiPageWikiLink Q40056.
- Q4056322 wikiPageWikiLink Q486926.
- Q4056322 wikiPageWikiLink Q5021477.
- Q4056322 wikiPageWikiLink Q599031.
- Q4056322 wikiPageWikiLink Q7049263.
- Q4056322 wikiPageWikiLink Q782543.
- Q4056322 wikiPageWikiLink Q79872.
- Q4056322 wikiPageWikiLink Q835922.
- Q4056322 wikiPageWikiLink Q9143.
- Q4056322 wikiPageWikiLink Q92618.
- Q4056322 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).".
- Q4056322 label "Automata-based programming".