Conjunctive Query Answering in the Description Logic SHIQ by Glimm, B, Horrocks, I, Lutz, C, Sattler, U

Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue by Henning Fernau

“…We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.…”
Get full text

Finite automata based processing of two-dimensional images by Jonas Valantinas

“… Finite automata theory based methodics for the compression of two-dimensional gray-scale images is presented. …”
Get full text

Cordial Languages and Cordial Numbers by J. Baskar BABUJEE, L. SHOBANA

“…In this paper we develop a new sequence of numbers called the cordial numbers in number theory using the labeling techniques in graph theory on automata theory.…”
Get full text

Analysis of Asynchronous Concurrent Systems by Timed Petri Nets by Ramchandani, Chander

“…In the first part, a suitable model is developed for describing the structure of asynchronous concurrent systems. In conventional automata theory, the finite-state machine model is used to describe the behavior of systems; the problem with this is that a large number of states results when practical systems are modelled.…”
Get full text

If Physics Is an Information Science, What Is an Observer? by Chris Fields

“…This paper investigates the consequences of replacing such an informationally-impoverished observer with an observer that satisfies the requirements of classical automata theory, i.e., an observer that encodes sufficient prior information to identify the system being observed and recognize its acceptable states. …”
Get full text

Subsumption of Concepts in FL0 for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE−complete. by Kazakov, Y, de Nivelle, H

“…We prove that the subsumption problem in \\cal FL_0 is PSPACE-complete for descriptive semantics when cyclic definitions are allowed. Our proof uses automata theory and as a by-product we establish the PSPACE-completeness of a certain decision problem for regular languages…”

A Concrete Approach to Abstract Recursive Definitions by Wand, Mitchell

“…Several well-known theorems of language and automata theory are drawn as special cases of this theorem.…”
Get full text

Decision Tree Induction using Adaptive FSA by Hemerson Pistori, Joao Jose Neto

“…One of the main feature of this algorithm is the application of automata theory to formalize the problem of decision tree induction and the use of a hybrid approach, which integrates both syntactical and statistical strategies. …”
Get full text

Semi-Automatic Generation of Competency Maps Based on Educational Data Mining by David Alfonso, Angeles Manjarrés, Simon Pickin

“…We tested our method on a large repository of responses to multiple-choice exam questions from an undergraduate course in Languages and Automata Theory at Spain's national distance-learning university (UNED). …”
Get full text

Automata On a 2-Dimensional Tape by Blum, M., Hewitt, C.

“…The rudimentary theory of vision presented here lies within the framework of automata theory. Out goal is to classify the types of patterns that can be recognized by an automaton that scans a finite 2-dimensional tape. …”
Get full text

Solutions to All-Colors Problem on Graph Cellular Automata by Xiaoyan Zhang, Chao Wang

“…We also introduce a new kind of All-Colors Problem, k-Random Weak-All-Colors Problem, which is relevant to both combinatorial number theory and cellular automata theory.…”
Get full text

Can Nondeterminism Help Complementation? by Yang Cai, Ting Zhang

“…Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. …”
Get full text

On the Path-Width of Integer Linear Programming by Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato

“…We also show how this new result links to automata theory and program verification.…”
Get full text

Formations of Monoids, Congruences, and Formal Languages by A. Ballester-Bolinches, E. Cosme-Llópez, R. Esteban-Romero, J.J.M.M. Rutten

“…The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. …”
Get full text

Research on the application of cellular automata and improved BP neural network in road design of logistics park by Ge Yanyan

“…Based on cellular automata theory, this paper presents a hybrid traffic flow model which is more suitable for the traffic characteristics of the logistics park, and analyzes the complexity of the collection and evacuation system in the logistics park, combined with BP neural network and its improved algorithm, the method of road design in Logistics Park is studied and the feasibility and validity of the model and algorithm are verified by an example. …”
Get full text

Driver Behaviour Algorithms for the Cellular Automata-Based Mathematical Model of Traffic Flows by Chechina Antonina, Churbanova Natalia, Trapeznikova Marina

“…The work is devoted to the development of new algorithms describing the complex interaction of drivers for the parallel numerical implementation of the traffic flow model developed by the authors based on the cellular automata theory. As is known from observations, the behaviour of drivers largely determines how difficult it will be to pass a section with a bottleneck (a narrowing, a motionless obstacle, etc.) or even without it at the same flow values. …”
Get full text

The Theory of Finitely Supported Structures and Choice Forms by A. Alexandru

“…The motivation for developing such a theory comes from both mathematics (by modelling infinite algebraic structures, hierarchically defined by involving some basic elements called atoms, in a finitary manner, by analyzing their finite supports) and computer science (where finitely supported sets are used in various areas such as semantics foundation, automata theory, domain theory, proof theory and software verification). …”
Get full text

Generalized Roughness of (∈, ∈ ∨q)-Fuzzy Ideals in Ordered Semigroups by Azmat Hussain, Muhammad İrfan Ali, Tahir Mahmood

“…OSGs have broadapplications in various fields such as coding theory, automata theory, fuzzyfinite state machines and computer science etc. …”
Get full text

A dynamic estimation method for aircraft emergency evacuation based on cellular automata by Yugang Zhang, Zhaohui Yang, Zhongchao Sun

“…Then, the emergency guiding model is established based on the cellular automata theory. In this model, multiple factors are considered, such as seat pitch, exit width, and occupant behavior. …”
Get full text