scholarly journals Fuzzy String Matching Using a Prefix Table

2020 ◽  
pp. 116-121
Author(s):  
Armen Kostanyan
Keyword(s):  
Artificial Intelligence ◽  
Finite State Machine ◽  
String Matching ◽  
Two Dimensional ◽  
Matching Problem ◽  
Machine Method ◽  
One Dimensional ◽  
Finite State ◽  
Fuzzy Pattern ◽  
The One

The string matching problem (that is, the problem of finding all occurrences of a pattern in the text) is one of the well-known problems in symbolic computations with applications in many areas of artificial intelligence. The most famous algorithms for solving it are the finite state machine method and the Knuth-Morris-Pratt algorithm (KMP). In this paper, we consider the problem of finding all occurrences of a fuzzy pattern in the text. Such a pattern is defined as a sequence of fuzzy properties of text characters. To construct a solution to this problem, we introduce a two-dimensional prefix table, which is a generalization of the one-dimensional prefix array used in the KMP algorithm.

scholarly journals A String Diagrammatic Axiomatisation of Finite-State Automata

2021 ◽  
pp. 469-489
Author(s):  
Robin Piedeleu ◽  
Fabio Zanasi
Keyword(s):  
Graphical Representation ◽  
Equational Theory ◽  
Finite State Automata ◽  
Regular Expressions ◽  
Two Dimensional ◽  
One Dimensional ◽  
Finite State ◽  
The One ◽  
Language Equivalence ◽  
Usual State

AbstractWe develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite— a result which is provably impossible for the one-dimensional syntax of regular expressions. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.

scholarly journals APPLICATION OF THE FINITE STATE MACHINE METHOD IN ANDROID-BASED PANDEMIC NIGHTMARE GAME

2021 ◽  
Vol 5 (1) ◽  
pp. 291-298
Author(s):  
Muhammad Khafidh Aulia ◽  
Ali Mahmudi ◽  
Sentot Achmadi
Keyword(s):  
Artificial Intelligence ◽  
Finite State Machine ◽  
State Machine ◽  
Game Engine ◽  
User Testing ◽  
Test Device ◽  
Machine Method ◽  
Unity 3D ◽  
Finite State ◽  
Android Operating System

The Covid-19 pandemic has limited activities outside the home. One of the government's efforts to break the chain of spreading the Covid-19 virus is to urge people to stay at home and carry out all work and study activities online. To get rid of boredom during a pandemic, researchers took the initiative to make a game about teenage nightmares during a pandemic that can be played on Android devices. This research is the creation of an Android-based Pandemic Nightmare game. The method used is FSM (Finite State Machine) as the artificial intelligence of the NPC (Non Playable Character) character in the Pandemic Nightmare game. The need for the thesis product being developed includes Unity 3D as a game engine and Android as a test device. The results of this research are a product in the form of a game that can be run on devices with an Android operating system at least version 5.0 Lollipop. These products have features such as touch controls on the smartphone screen, NPCs that have artificial intelligence, items that can be collected at each level, sound settings, level selection, and fear features that can reduce player visibility. Based on the features contained in the Pandemic Nightmare game, all features can function properly and correctly. Based on user testing, it is known that the majority of users think the games developed are good. Based on the results of the study, it can be concluded that artificial intelligence with the FSM (Finite State Machine) method functions properly, the control buttons and menu buttons function properly. Based on user testing, the Pandemic Nightmare game is good and worth playing.

Regions-based Two-dimensional Continua: The Euclidean Case

2018 ◽  
Author(s):  
Geoffrey Hellman ◽  
Stewart Shapiro
Keyword(s):  
Mathematical Induction ◽  
Dimensional Case ◽  
Two Dimensional ◽  
Entire Space ◽  
Euclidean Case ◽  
Free Basis ◽  
One Dimensional ◽  
Archimedean Property ◽  
The One

This chapter develops a Euclidean, two-dimensional, regions-based theory. As with the semi-Aristotelian account in Chapter 2, the goal here is to recover the now orthodox Dedekind–Cantor continuum on a point-free basis. The chapter derives the Archimedean property for a class of readily postulated orientations of certain special regions, what are called “generalized quadrilaterals” (intended as parallelograms), by which the entire space is covered. Then the chapter generalizes this to arbitrary orientations, and then establishes an isomorphism between the space and the usual point-based one. As in the one-dimensional case, this is done on the basis of axioms which contain no explicit “extremal clause”, and we have no axiom of induction other than ordinary numerical (mathematical) induction.

scholarly journals FPGA Implementation of Reconfigurable Finite State Machine with Input Multiplexing Architecture Using Hungarian Method

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Nitish Das ◽  
P. Aruna Priya
Keyword(s):  
Finite State Machine ◽  
Graph Matching ◽  
Digital Signal ◽  
State Machine ◽  
Fpga Implementation ◽  
Greedy Heuristic ◽  
Matching Problem ◽  
Input Selection ◽  
Weighted Bipartite Graph ◽  
Finite State

The mathematical model for designing a complex digital system is a finite state machine (FSM). Applications such as digital signal processing (DSP) and built-in self-test (BIST) require specific operations to be performed only in the particular instances. Hence, the optimal synthesis of such systems requires a reconfigurable FSM. The objective of this paper is to create a framework for a reconfigurable FSM with input multiplexing and state-based input selection (Reconfigurable FSMIM-S) architecture. The Reconfigurable FSMIM-S architecture is constructed by combining the conventional FSMIM-S architecture and an optimized multiplexer bank (which defines the mode of operation). For this, the descriptions of a set of FSMs are taken for a particular application. The problem of obtaining the required optimized multiplexer bank is transformed into a weighted bipartite graph matching problem where the objective is to iteratively match the description of FSMs in the set with minimal cost. As a solution, an iterative greedy heuristic based Hungarian algorithm is proposed. The experimental results from MCNC FSM benchmarks demonstrate a significant speed improvement by 30.43% as compared with variation-based reconfigurable multiplexer bank (VRMUX) and by 9.14% in comparison with combination-based reconfigurable multiplexer bank (CRMUX) during field programmable gate array (FPGA) implementation.

MUTUAL EXCLUSION ON OPTICAL BUSES

2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA
Keyword(s):  
Mutual Exclusion ◽  
Two Dimensional ◽  
One Dimensional ◽  
Dimensional Array ◽  
Propagation Delays ◽  
Optical Buses ◽  
The One

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.

scholarly journals DIFFERENTIAL EQUATION APPROACH FOR ONE- AND TWO-DIMENSIONAL LATTICE GREEN'S FUNCTION

2007 ◽  
Vol 21 (02n03) ◽  
pp. 139-154 ◽  
Author(s):  
J. H. ASAD
Keyword(s):  
Differential Equation ◽  
Green’S Function ◽  
Recurrence Relation ◽  
Green's Function ◽  
Two Dimensional ◽  
Dimensional Lattice ◽  
One Dimensional ◽  
The One ◽  
Lattice Green's Function ◽  
Lattice Green’S Function

A first-order differential equation of Green's function, at the origin G(0), for the one-dimensional lattice is derived by simple recurrence relation. Green's function at site (m) is then calculated in terms of G(0). A simple recurrence relation connecting the lattice Green's function at the site (m, n) and the first derivative of the lattice Green's function at the site (m ± 1, n) is presented for the two-dimensional lattice, a differential equation of second order in G(0, 0) is obtained. By making use of the latter recurrence relation, lattice Green's function at an arbitrary site is obtained in closed form. Finally, the phase shift and scattering cross-section are evaluated analytically and numerically for one- and two-impurities.

Substrate induced freezing, melting and depinning transitions in two-dimensional liquid crystalline systems

2022 ◽  
Author(s):  
Bharti bharti ◽  
Debabrata Deb
Keyword(s):  
Molecular Dynamics ◽  
Liquid Crystals ◽  
Molecular Dynamics Simulations ◽  
Liquid Crystalline ◽  
Two Dimensional ◽  
One Dimensional ◽  
The One ◽  
Dynamics Simulations

We use molecular dynamics simulations to investigate the ordering phenomena in two-dimensional (2D) liquid crystals over the one-dimensional periodic substrate (1DPS). We have used Gay-Berne (GB) potential to model the...

scholarly journals Water storage in wetted strips under irrigated coffee trees with different criteria of irrigation management

2013 ◽  
Vol 33 (2) ◽  
pp. 249-257 ◽  
Author(s):  
Alberto Colombo ◽  
Lívia A. Alvarenga ◽  
Myriane S. Scalco ◽  
Randal C. Ribeiro ◽  
Giselle F. Abreu
Keyword(s):  
Dimensional Analysis ◽  
Drip Irrigation ◽  
Irrigation Management ◽  
Water Storage ◽  
Moisture Distribution ◽  
Water Volume ◽  
Two Dimensional ◽  
One Dimensional ◽  
Irrigation Interval ◽  
The One

The increasing demand for water resources accentuates the need to reduce water waste through a more appropriate irrigation management. In the particular case of irrigated coffee planting, which in recent years presented growth with the predominance of drip irrigation, the improvement of drip irrigation management techniques is a necessity. The proper management of drip irrigation depends on the knowledge of the spatial pattern of soil moisture distribution inside the wetted strip formed under the irrigation lines. In this study, grids of 24 tensiometers were used to determine the water storage within the wetted strip formed under drippers, with a 3.78 L h-1 discharge, evenly spaced by 0.4 m, subjected to two different management criteria (fixed irrigation interval and 60 kPa tension). Estimates of storage based on a one-dimensional analysis, that only considers depth variations, were compared with two-dimensional estimates. The results indicate that for high-frequency irrigation the one-dimensional analysis is not appropriate. However, under less frequent irrigation, the two-dimensional analysis is dispensable, being the one-dimensional sufficient for calculating the water volume stored in the wetted strip.

Computationally Efficient Model for 2D Ion Implantation Simulation

1997 ◽  
Vol 490 ◽  
Author(s):  
Misha Temkin ◽  
Ivan Chakarov
Keyword(s):  
Ion Implantation ◽  
Efficient Method ◽  
Two Dimensional ◽  
Computationally Efficient ◽  
Crystalline Materials ◽  
One Dimensional ◽  
The One

ABSTRACTA computationally efficient method for ion implantation simulation is presented. The method allows two-dimensional ion implantation profiles in arbitrary shaped structures to be calculated and is valid for both amorphous and crystalline materials. It uses an extension of the one-dimensional dual Pearson approximation into the second dimension.

Sign in / Sign up

Export Citation Format

Share Document