scholarly journals Myths and facts about the efficient implementation of finite automata and lexical analysis

1998 ◽  
pp. 1-15 ◽  
Author(s):  
Klaus Brouwer ◽  
Wolfgang Gellerich ◽  
Erhard Ploedereder
Keyword(s):  
Finite Automata ◽  
Efficient Implementation ◽  
Lexical Analysis

scholarly journals A Survey about various Generations of Lexical Analyzer

2019 ◽  
Vol 8 (2) ◽  
pp. 50
Author(s):  
Zakiya Ali Nayef
Keyword(s):  
Active Learning ◽  
Regular Expression ◽  
Finite Automata ◽  
General Idea ◽  
Lexical Analysis ◽  
Advantages And Disadvantages ◽  
Lexical Analyzer

Lexical analysis helps the interactivity and visualization for active learning that can improve difficult concepts in automata. This study gives a view on different lexical analyzer generators that has been implemented for different purposes in finite automata. It also intends to give a general idea on the lexical analyzer process, which will cover the automata model that is used in the various reviews. Some concepts that will be described are finite automata model, regular expression and other related components. Also, the advantages and disadvantages of lexical analyzer will be discussed. 

scholarly journals An Fuzzy Lexical Research

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1209-1211
Keyword(s):  
Finite Automata ◽  
String Matching ◽  
Regular Languages ◽  
Regular Expressions ◽  
Lexical Analysis ◽  
Design And Implementation ◽  
Comprehensive View ◽  
Analysis Phase ◽  
Source Program ◽  
Degree Of Membership

The objective of this paper is to analyse the design and implementation of the fuzzy lexical analyser and observe how it is different from the traditional lexical analyser. It is known that lexical analysis is an important phase of a compiler. It reads the source program character by character and uses regular expressions, finite automata methods for string matching. Unlike traditional lexical analysers, tokens in fuzzy analysers belong to more than one token type with varying degree of membership. The paper exchange views on the design and implementation of fuzzy lexical analysers. It observes algorithms that handle errors due to insertion, deletion etc. in the lexical analysis phase of a compiler. Several properties of fuzzy languages are also reviewed. Hence this paper gives a comprehensive view of fuzzy regular languages, models and algorithms

scholarly journals Data type Modeling with DFA and NFA as a Lexical Analysis Generator

2019 ◽  
Vol 8 (4) ◽  
pp. 415
Author(s):  
Nisreen L. Abdulnabi ◽  
Hawar B. Ahmad
Keyword(s):  
Active Learning ◽  
Finite Automata ◽  
Data Type ◽  
Lexical Analysis ◽  
Lexical Analyzer

Lexical analysis helps the interactivity and visualization for active learning that can improve difficult concepts in automata. This study gives an implementation of two frequently used model, NFA for combination of Real and Integer data type and DFA for Double Data Type in Java this chosen model will be implemented using JFLAP. The model will also be tested using JFLAP that will accept at least FIVE (5) inputs and rejected FIVE (5) inputs. These two models are some of the different lexical analyzer generators that have been implemented for different purposes in finite automata.

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.

Sign in / Sign up

Export Citation Format

Share Document