97 relations: Abstract machine, Abstract State Machine Language, Abstract state machines, Addison-Wesley, Alphabet (formal languages), Artificial intelligence, Automata theory, Automata-based programming, Behavior selection algorithm, Binary number, Biology, Cambridge University Press, Combination lock, Combinational logic, Communicating finite-state machine, Communication protocol, Compiler, Compilers: Principles, Techniques, and Tools, Computational linguistics, Computer memory, Computer science, Control system, Control table, Decision table, Deterministic finite automaton, DEVS, Digital electronics, Directed graph, Electrical engineering, Elevator, Empty string, Event-driven finite-state machine, Extended finite-state machine, Finite state machine with datapath, Finite-state transducer, Flip-flop (electronics), Generalized nondeterministic finite automaton, Hamburg University of Applied Sciences, Hidden Markov model, Implication table, Input (computer science), International Telecommunication Union, Introduction to Automata Theory, Languages, and Computation, Lexical analysis, Linguistics, Logic, Logic gate, Markov chain, Mathematics, Mealy machine, ..., Model of computation, Moore machine, Moore reduction procedure, National Institute of Standards and Technology, Nondeterministic finite automaton, Partial function, Petri net, Philosophy, Powerset construction, Processor register, Programmable logic controller, Programmable logic device, Pushdown automaton, Quantum finite automata, Recursively enumerable language, Regular language, Relay, Richards controller, SCXML, Semiautomaton, Semiring, Sequential logic, Shortest path problem, Software engineering, Specification and Description Language, State (computer science), State diagram, State encoding for low power, State pattern, State transition table, String (computer science), Subshift of finite type, Theory of computation, Token coin, Traffic light, Transition system, Tree automaton, Truth table, Tuple, Turing machine, Turnstile, UML state machine, Unified Modeling Language, Vending machine, Vertex (graph theory), Virtual finite-state machine, YAKINDU Statechart Tools. Expand index (47 more) » « Shrink index
An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system used in automata theory.
Abstract State Machine Language (AsmL) is a programming language based on the Abstract State Machines formal method and developed by Microsoft.
In computer science, an abstract state machine (ASM) is a state machine operating on states that are arbitrary data structures (structure in the sense of mathematical logic, that is a nonempty set together with a number of functions (operations) and relations over the set).
Addison-Wesley is a publisher of textbooks and computer literature.
In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the alphabet of a string or collection of strings.
Artificial intelligence (AI, also machine intelligence, MI) is intelligence demonstrated by machines, in contrast to the natural intelligence (NI) displayed by humans and other animals.
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them.
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 other (often more complicated) formal automaton (see automata theory).
In artificial intelligence, a behavior selection algorithm, or action selection algorithm, is an algorithm that selects appropriate behaviors or actions for one or more intelligent agents.
In mathematics and digital electronics, a binary number is a number expressed in the base-2 numeral system or binary numeral system, which uses only two symbols: typically 0 (zero) and 1 (one).
Biology is the natural science that studies life and living organisms, including their physical structure, chemical composition, function, development and evolution.
Cambridge University Press (CUP) is the publishing business of the University of Cambridge.
A combination lock is a type of locking device in which a sequence of symbols, usually numbers, is used to open the lock.
In digital circuit theory, combinational logic (sometimes also referred to as time-independent logic) is a type of digital logic which is implemented by Boolean circuits, where the output is a pure function of the present input only.
In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet of channels.
In telecommunication, a communication protocol is a system of rules that allow two or more entities of a communications system to transmit information via any kind of variation of a physical quantity.
A compiler is computer software that transforms computer code written in one programming language (the source language) into another programming language (the target language).
Compilers: Principles, Techniques, and Tools is a computer science textbook by Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman about compiler construction.
Computational linguistics is an interdisciplinary field concerned with the statistical or rule-based modeling of natural language from a computational perspective, as well as the study of appropriate computational approaches to linguistic questions.
In computing, memory refers to the computer hardware integrated circuits that store information for immediate use in a computer; it is synonymous with the term "primary storage".
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
A control system manages, commands, directs, or regulates the behavior of other devices or systems using control loops.
Control tables are tables that control the control flow or play a major part in program control.
Decision tables are a concise visual representation for specifying which actions to perform depending on given conditions.
In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as a deterministic finite acceptor (DFA) and a deterministic finite state machine (DFSM) or a deterministic finite state automaton (DFSA)—is a finite-state machine that accepts or rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string.
DEVS abbreviating Discrete Event System Specification is a modular and hierarchical formalism for modeling and analyzing general systems that can be discrete event systems which might be described by state transition tables, and continuous state systems which might be described by differential equations, and hybrid continuous state and discrete event systems.
Digital electronics or digital (electronic) circuits are electronics that operate on digital signals.
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them.
Electrical engineering is a professional engineering discipline that generally deals with the study and application of electricity, electronics, and electromagnetism.
An elevator (US and Canada) or lift (UK, Australia, Ireland, New Zealand, and South Africa, Nigeria) is a type of vertical transportation that moves people or goods between floors (levels, decks) of a building, vessel, or other structure.
In formal language theory, the empty string, or empty word is the unique string of length zero.
In computation, a finite-state machine (FSM) is event driven if the transition from one state to another is triggered by an event or a message.
In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions.
A Finite State Machine with Datapath (FSMD) is a mathematical abstraction that is sometimes used to design digital logic or computer programs.
A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output tape.
In electronics, a flip-flop or latch is a circuit that has two stable states and can be used to store state information.
In the theory of computation, a generalized nondeterministic finite automaton (GNFA), also known as an expression automaton or a generalized nondeterministic finite state machine, is a variation of a nondeterministic finite automaton (NFA) where each transition is labeled with any regular expression.
The Hamburg University of Applied Sciences is an institution of higher education and applied research located in Hamburg, Germany.
Hidden Markov Model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process with unobserved (i.e. hidden) states.
An implication table is a tool used to facilitate the minimization of states in a state machine.
In computer science, the general meaning of input is to provide or give something to the computer, in other words, when a computer or device is receiving a command or signal from outer sources, the event is referred as input to the device.
The International Telecommunication Union (ITU; Union Internationale des Télécommunications (UIT)), originally the International Telegraph Union (Union Télégraphique Internationale), is a specialized agency of the United Nations (UN) that is responsible for issues that concern information and communication technologies.
Introduction to Automata Theory, Languages, and Computation is an influential computer science textbook by John Hopcroft and Jeffrey Ullman on formal languages and the theory of computation.
In computer science, lexical analysis, lexing or tokenization is the process of converting a sequence of characters (such as in a computer program or web page) into a sequence of tokens (strings with an assigned and thus identified meaning).
Linguistics is the scientific study of language, and involves an analysis of language form, language meaning, and language in context.
Logic (from the logikḗ), originally meaning "the word" or "what is spoken", but coming to mean "thought" or "reason", is a subject concerned with the most general laws of truth, and is now generally held to consist of the systematic study of the form of valid inference.
In electronics, a logic gate is an idealized or physical device implementing a Boolean function; that is, it performs a logical operation on one or more binary inputs and produces a single binary output.
A Markov chain is "a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event".
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs.
In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how a set of outputs are computed given a set of inputs.
In the theory of computation, a Moore machine is a finite-state machine whose output values are determined only by its current state.
In computer science, the Moore reduction procedure is a method used for DFA minimization.
The National Institute of Standards and Technology (NIST) is one of the oldest physical science laboratories in the United States.
In automata theory, a finite state machine is called a deterministic finite automaton (DFA), if.
In mathematics, a partial function from X to Y (written as or) is a function, for some subset X ′ of X.
A Petri net, also known as a place/transition (PT) net, is one of several mathematical modeling languages for the description of distributed systems.
Philosophy (from Greek φιλοσοφία, philosophia, literally "love of wisdom") is the study of general and fundamental problems concerning matters such as existence, knowledge, values, reason, mind, and language.
In the theory of computation and automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language.
In computer architecture, a processor register is a quickly accessible location available to a computer's central processing unit (CPU).
A programmable logic controller (PLC), or programmable controller is an industrial digital computer which has been ruggedized and adapted for the control of manufacturing processes, such as assembly lines, or robotic devices, or any activity that requires high reliability control and ease of programming and process fault diagnosis.
A programmable logic device (PLD) is an electronic component used to build reconfigurable digital circuits.
In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process.
In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings of the language.
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be expressed using a regular expression, in the strict sense of the latter notion used in theoretical computer science (as opposed to many regular expressions engines provided by modern programming languages, which are augmented with features that allow recognition of languages that cannot be expressed by a classic regular expression).
A relay is an electrically operated switch.
The Richards controller is a method of implementing a finite state machine using simple integrated circuits and combinational logic.
SCXML stands for State Chart XML: State Machine Notation for Control Abstraction.
In mathematics and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output.
In abstract algebra, a semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse.
In digital circuit theory, sequential logic is a type of logic circuit whose output depends not only on the present value of its input signals but on the sequence of past inputs, the input history.
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
Software engineering is the application of engineering to the development of software in a systematic method.
Specification and Description Language (SDL) is a specification language targeted at the unambiguous specification and description of the behaviour of reactive and distributed systems.
In information technology and computer science, a program is described as stateful if it is designed to remember preceding events or user interactions; the remembered information is called the state of the system.
A state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems.
State encoding assigns a unique pattern of ones and zeros to each defined state of a finite-state machine (FSM).
The state pattern is a behavioral software design pattern that implements a state machine in an object-oriented way.
In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state and other inputs.
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.
In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory.
In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm.
In the study of numismatics, token coins or trade tokens are coin-like objects used instead of coins.
Traffic lights, also known as traffic signals, traffic lamps, traffic semaphore, signal lights, stop lights, robots (in South Africa and most of Africa), and traffic control signals (in technical parlance), are signalling devices positioned at road intersections, pedestrian crossings, and other locations to control flows of traffic.
In theoretical computer science, a transition system is a concept used in the study of computation.
A tree automaton is a type of state machine.
A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables (Enderton, 2001).
In mathematics, a tuple is a finite ordered list (sequence) of elements.
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.
A turnstile, also called a baffle gate or turnstyle, is a form of gate which allows one person to pass at a time.
UML state machine, also known as UML statechart, is a significantly enhanced realization of the mathematical concept of a finite automaton in computer science applications as expressed in the Unified Modeling Language (UML) notation.
The Unified Modeling Language (UML) is a general-purpose, developmental, modeling language in the field of software engineering, that is intended to provide a standard way to visualize the design of a system.
A vending machine is an automated machine that provides items such as snacks, beverages, cigarettes and lottery tickets to consumers after money, a credit card, or specially designed card is inserted into the machine.
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
A virtual finite state machine is a finite state machine (FSM) defined in a virtual environment.
YAKINDU Statechart Tools (YAKINDU SCT) is a tool for the specification and development of reactive, event-driven systems with the help of finite-state machines.
Accept state, Accepting state, Acceptor (finite-state machine), Deterministic automata, FSA Utilities, Finate state automata, Finite Automata, Finite State Automaton, Finite State Machine, Finite State Machines, Finite automata, Finite automaton, Finite state, Finite state acceptor, Finite state automata, Finite state automaton, Finite state grammar, Finite state language, Finite state machine, Finite state machines, Finite state recognizer, Finite state-machine, Finite-state automata, Finite-state automaton, Finite-state machines, Finite-state recognizer, Optimization of finite state machines, Recognizer, Recognizers, SFSM, Sequence detector, Sequence detectors, Start state, State Machine, State machine, State machines, State transition function, State-machine.