China
Africa
Explore chapters and articles related to this topic
A
Published in Phillip A. Laplante, Dictionary of Computer Science, Engineering, and Technology, 2017
automata theory a mathematical discipline which studies abstract computational processes. An automaton is an abstract computational device. See finite state automaton, pushdown automaton, nondeterministic push-down automaton, and Turing machine.
A
Published in Philip A. Laplante, Comprehensive Dictionary of Electrical Engineering, 2018
automatic transfer switch automatic transfer switch a self-acting switch which transfers one or more load conductor connections from one power source to another. automatic voltage regulator (AVR) an automatic feedback control system that is responsible for maintaining a scheduled voltage either at the terminals of a synchronous generator or at the high-side bus of the generator step-up transformer. The control is brought about by changing the level of excitation. automation refers to the bringing together of machine tools, materials handling process, and controls with little worker intervention, including (1) a continuous flow production process that integrates various mechanisms to produce an item with relatively few or no worker operations, usually through electronic control; (2) self-regulating machines (feedback) that can perform highly precise operations in sequence; and (3) electronic computing machines. In common use, however, the term is often used in reference to any type of advanced mechanization or as a synonym for technological progress; more specifically, it is usually associated with cybernetics. automaton (1) a fundamental concept in mathematics, computer engineering, and robotics. (2) a machine that follows sequence of instructions. (3) any automated device (robots, mechanical and electromechanical chess automata). Automata (plural of automaton) theory studies various types of automata, their properties and limitations. See also cellular automaton, finite state machine (FSM). autonomic that part of the nervous system which controls the internal organs. autonomous operation operation of a sequential circuit in which no external signals, other than clock signals, are applied. The necessary logic inputs are derived internally using feedback circuits. autonomous system a dynamic system described by a first-order vector differential equation that is unforced and stationary. In other words, such a system is governed by an equation of the form x (t) = f (x(t)) See also unforced system and stationary system. autoregressive (AR) a pth order autoregressive process is a discrete random process that is generated by passing white noise through an all-pole digital filter having p poles. Alternatively, x[n] is a pth order AR process if
Synthesis of regular expression problems and solutions
Published in International Journal of Computers and Applications, 2020
One of the most difficult computer science courses to teach or learn at the undergraduate level is Formal Languages and Automata Theory (FLA) [1–3] and high failure rates have been recorded around the world in FLA [4]. This course goes by many aliases, such as: Theory of Computation, Automata Theory, or Formal Language Theory. Online voters have ‘weighed-in’ in many informal surveys suggesting that FLA is definitely in the top three hardest computer science modules to learn, along side with courses such as Operating Systems and Theory of Algorithms [5]. These surveys further reveal that concepts taught in FLA are also the hardest to learn on the job [6]. The importance of understanding FLA cannot be overemphasized. Many concepts taught in this course is applicable in many disciplines for building special-purpose compilers, string matching, theory proving, checking for finiteness, estimating computability of algorithms, and so on [7–10].
A computational journey in the true north
Published in International Journal of Parallel, Emergent and Distributed Systems, 2020
The density classification problem is arguably the most studied problem in cellular automata theory: Given a two-state cellular automaton, does it contain more black or more white cells?The planar convex hull problem is a fundamental problem in computational geometry: Given a set of n points, what is the convex polygon with the smallest possible area containing all of them?