Complexity of hierarchical networks of finite automata

1987 ◽  
pp. 113-118
Author(s):  
M. I. Kanovich
Keyword(s):  
Finite Automata ◽  
Hierarchical Networks

A novel cryptosystem based on abstract automata and Latin cubes

2015 ◽  
Vol 52 (2) ◽  
pp. 221-232
Author(s):  
Pál Dömösi ◽  
Géza Horváth
Keyword(s):  
Block Cipher ◽  
Finite Automata ◽  
Theoretical Background ◽  
Point Of View ◽  
Theoretical Point ◽  
Transition Matrices ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Automata Network ◽  
Fully Functioning

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

Parallel Combining Different Approaches to Multi-pattern Matching for Fpga-based Security Systems

2017 ◽  
Vol 5 (1) ◽  
pp. 8-15
Author(s):  
Sergii Hilgurt ◽  
Keyword(s):  
Information Security ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Detection System ◽  
Finite Automata ◽  
Network Intrusion Detection ◽  
Security Systems ◽  
Analytical Technique ◽  
Network Intrusion ◽  
Pros And Cons

The multi-pattern matching is a fundamental technique found in applications like a network intrusion detection system, anti-virus, anti-worms and other signature- based information security tools. Due to rising traffic rates, increasing number and sophistication of attacks and the collapse of Moore’s law, traditional software solutions can no longer keep up. Therefore, hardware approaches are frequently being used by developers to accelerate pattern matching. Reconfigurable FPGA-based devices, providing the flexibility of software and the near-ASIC performance, have become increasingly popular for this purpose. Hence, increasing the efficiency of reconfigurable information security tools is a scientific issue now. Many different approaches to constructing hardware matching circuits on FPGAs are known. The most widely used of them are based on discrete comparators, hash-functions and finite automata. Each approach possesses its own pros and cons. None of them still became the leading one. In this paper, a method to combine several different approaches to enforce their advantages has been developed. An analytical technique to quickly advance estimate the resource costs of each matching scheme without need to compile FPGA project has been proposed. It allows to apply optimization procedures to near-optimally split the set of pattern between different approaches in acceptable time.

Complexity and Universality of Iterated Finite Automata

2009 ◽  
Vol 18 (1) ◽  
pp. 145-158
Author(s):  
Jiang Zhang ◽  
Keyword(s):  
Finite Automata

The Political Economy of Rural-Urban Conflict

2017 ◽  
Author(s):  
Topher L. McDougal
Keyword(s):  
Political Economy ◽  
Urban Areas ◽  
The State ◽  
Hierarchical Networks ◽  
Capital Cities ◽  
Trade Networks ◽  
Rural And Urban Areas ◽  
Rural And Urban ◽  
Economic Relationship ◽  
Relationship Of

In some cases of insurgency, the combat frontier is contested and erratic, as rebels target cities as their economic prey. In other cases, it is tidy and stable, seemingly representing an equilibrium in which cities are effectively protected from violent non-state actors. What factors account for these differences in the interface urban-based states and rural-based challengers? To explore this question, this book examines two regions representing two dramatically different outcomes. In West Africa (Liberia and Sierra Leone), capital cities became economic targets for rebels, who posed dire threats to the survival of the state. In Maoist India, despite an insurgent ideology aiming to overthrow the state via a strategy of progressive city capture, the combat frontier effectively firewalls cities from Maoist violence. This book argues that trade networks underpinning the economic relationship between rural and urban areas—termed “interstitial economies”—may differ dramatically in their impact on (and response to) the combat frontier. It explains rebel predatory tendencies toward cities as a function of transport networks allowing monopoly profits to be made by urban-based traders. It explains combat frontier delineation as a function of the social structure of the trade networks: hierarchical networks permit elite–elite bargains that cohere the frontier. These factors represent what might be termed respectively the “hardware” and “software” of the rural–urban economic relationship. Of interest to any student of political economy and violence, this book presents new arguments and insights about the relationships between violence and the economy, predation and production, core and periphery.

A Generalization of Finite Automata

1987 ◽  
Vol 10 (4) ◽  
pp. 415-435
Author(s):  
Kazimierz Wiśniewski
Keyword(s):  
Finite Automata

Microprogram/finite automata

1970 ◽  
Vol 1 (3) ◽  
pp. 10-10
Author(s):  
L. V. Matsevityy
Keyword(s):  
Finite Automata

scholarly journals On the Power of Two-Dimensional Synchronized Alternating Finite Automata1

1991 ◽  
Vol 15 (1) ◽  
pp. 90-98
Author(s):  
Juraj Hromkovič ◽  
Katsushi Inoue ◽  
Akira Ito ◽  
Itsuo Takanami
Keyword(s):  
Finite Automata ◽  
Two Dimensional ◽  
Rectangular Array

It is well known that four-way two-dimensional alternating finite automata are more powerful than three-way two-dimensional alternating finite automata, which are more powerful than two-way two-dimensional alternating finite automata. This paper shows that four-way, three-way, and two-way two-dimensional “synchronized” alternating finite automata all have the same power as rectangular array bounded automata.

scholarly journals PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 799-811
Author(s):  
MATHIEU GIRAUD ◽  
PHILLIPE VEBER ◽  
DOMINIQUE LAVENIER
Keyword(s):  
Surface Area ◽  
Finite Automata ◽  
Clock Frequency ◽  
Partial Removal ◽  
Frequency Constraints ◽  
Weighted Automata ◽  
Weighted Finite Automata ◽  
Special Case

Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ∊-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ∊-transitions-removal problem. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.

Sign in / Sign up

Export Citation Format

Share Document