Automata-based programming is a programming paradigm in which the program or part of it is thought of as a model of a finite-state machine (FSM) or any...

Automata-based programming is a programming technology. Its defining characteristic is the use of finite-state machines to describe program behavior....

finite-state machines: Automata-based programming Event-driven finite-state machine Virtual finite-state machine State design pattern Finite automata are often used...

Nier: Automata is a 2017 action role-playing game developed by PlatinumGames and published by Square Enix. It is a sequel to Nier (2010), itself a spin-off...

procedures, by writing code in one or more programming languages. Programmers typically use high-level programming languages that are more easily intelligible...

In computer programming, flow-based programming (FBP) is a programming paradigm that defines applications as networks of black box processes, which exchange...

This page is a list of television programs based on video games (both computer and console). Series adapted from novels, such as The Witcher and its spinoff...

tables can be specific implementations of finite-state-machine-based automata-based programming. If there are several hierarchical levels of control table...

Switch-technology for Automata-Based Programming. He is also a co-author of a UniMod tool that supports Automata-Based Programming. Initiator of the Foundation...

through a text-based user interface. Regardless of the technology available, the goal is to program in a programming language. Programming language features...

written in the B programming language. It was the first piece of mainline Unix software to be developed in a high-level programming language. Later, this...

Algebraic Programming, 78(4): 233-259, Elsevier, April 2009. J.-P. Talpin, C. Brunette, T. Gautier, and A. Gamatié. Polychronous mode automata. Proceedings...

Nier: Automata Ver1.1a is a Japanese anime television series based on the 2017 action role-playing game Nier: Automata. The plot follows androids of the...

who drew it up—creating the first of the devices later termed cellular automata. Another advance was introduced by the mathematician John Conway. He constructed...

An automaton (/ɔːˈtɒmətən/ ; pl.: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow...

Yoko Taro, and composed by music studio Monaca. Based on the 2017 action role-playing game Nier: Automata developed by PlatinumGames and published by Square...

characterization, and classification of formal languages known as programming languages. Programming language theory is closely related to other fields including...

automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular...

its surface form. Text-based computer languages are based on sequences of characters, while visual programming languages are based on the spatial layout...

functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm...

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in...

calculate the motion of each based on its neighbours' behaviours.: 8  Thus was born the first system of cellular automata. Like Ulam's lattice network...

of programming language design involve tradeoffs—for example, exception handling simplifies error handling, but at a performance cost. Programming language...

p_{s's}(a).} Probabilistic automata Odds algorithm Quantum finite automata Partially observable Markov decision process Dynamic programming Bellman equation for...

self-reproducing automata in the 1940s. Later, Paul Bratley and Jean Millo's article "Computer Recreations: Self-Reproducing Automata" discussed them in...

recognized by finite automata. A more powerful but still not Turing-complete extension of finite automata is the category of pushdown automata and context-free...

In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...

were among the first researchers to introduce a concept similar to finite automata in 1943. The figure illustrates a deterministic finite automaton using...

Программная инженерия. Том 10, № 1, 2019 (in Russian). Mitkin Stepan B. Automata-Based Programming in DRAKON Language. Programmnaya Ingeneria, 2019, vol. 10, no...

Aspect-oriented Automata-based Class-based Concatenative Concept Concurrent Data-driven Declarative (as opposed to imperative programming) Constraint Constraint...