An algorithm to design finite automata that accept strings over input symbol a and b having exactly x number of a &amp;amp; y number of b

Ather, Danish; Singh, Raghuraj; Katiyar, Vinodani

doi:10.1109/iciscon.2013.6524162

Cited by 7 publications

(3 citation statements)

References 12 publications

(1 reference statement)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The design of a non-deterministic finite automation vending machine is proposed in [13] using finite state machine and visual automata simulator, while [14] proposes efficient automata designs for software developments that improve the productivity of vending machines without increasing complexity. Deterministic finite automata are used to design an algorithm that automatically works on input strings containing a and b symbols in [15]. Finite state automata is also used in the design and implementation of an automated coffee maker machine that can make seven types of drinks automatically [16].…”

Section: σ= Set Of the Input Symbolmentioning

confidence: 99%

Enhancing Card Swipe Machines using Mathematical Model with JFLAP Formal Methods and Automation: A Mathematical Model with JFLAP

Arslan,

Hameed,

Imran

et al. 2023

VAWKUM trans. comput. sci.

View full text Add to dashboard Cite

Automation is a novel approach that can enhance production capacity, work quality, and working environment, while minimizing labor disputes by automating all handling parameters. Formal methods are scientiﬁc techniques used to design complex mathematical systems. They involve specifying requirements and verifying software systems. The card swipe machine is a widely used point-ofsale terminal in supermarkets, medical centers, and shopping malls. Customers can easily make payments through these machines, which also provide detailed receipts of all transactions, including reversed transactions. This resolves cash management issues, improves customer service, and supports marketing. While multiple conventional machines are available in the market, they lack visual representations, making it diﬃcult to understand their working mechanism without graphical representations. Deterministic ﬁnite automata (DFA) is a mathematical model that has limited states and moves from one state to another based on input and transition functions. This study proposes the use of the JFLAP software to create a mathematical model of card swipe machine transactions. The proposed model allows for viewing each processing step in a card swipe machine, offering a new approach to understanding their working mechanism.

show abstract

Section: σ= Set Of the Input Symbolmentioning

confidence: 99%

Enhancing Card Swipe Machines using Mathematical Model with JFLAP Formal Methods and Automation: A Mathematical Model with JFLAP

Arslan,

Hameed,

Imran

et al. 2023

VAWKUM trans. comput. sci.

View full text Add to dashboard Cite

show abstract

“…An algorithm is proposed to identify important transitions and critical patterns of a DFA [22]. An algorithm to design a DFA over alphabet consisting of a and b having exactly x number of a's and y number of b's is discussed in [9].…”

Section: Literature Surveymentioning

confidence: 99%

“…A formal language can be represented using a finite state machine [9]. For example, a regular language that is described using mathematical expressions called regular expressions can be recognized by finite automata [7].…”

Section: Introductionmentioning

confidence: 99%

Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings

Singh¹,

Goyal²

2021

SCRS Conference Proceedings on Intelligent Systems

View full text Add to dashboard Cite

The field of automata theory is one of the most important areas in the field of Computer Science and Engineering that deals with how efficiently a problem can be solved on a model of computation using an algorithm. There exists a variety of formal languages like regular, context free, context sensitive, etc. These formal languages are described as set of specific strings over a given alphabet and can be described using state or transition diagrams. The state/transition diagram for regular languages is called a finite automaton which is used in the lexical analysis phase of compiler design for recognition of tokens. The construction of finite automata is a complicated and challenging process as there is no fixed mathematical approach that exists for designing of DFA and handling the validations for acceptance or rejection of strings. Consequently, it is difficult to represent the DFA’s transition table and graph. The present paper proposes an algorithm for designing of deterministic finite automata (DFA) for a regular language with a given prefix. The proposed method further aims to simplify the lexical analysis process of compiler design.

show abstract

Simple algorithm to construct deterministic finite automata from non-deterministic finite automata using initial state transitions successor

Pisal¹,

Ghatule²,

Lawate³

2022

The 2ND UNIVERSITAS LAMPUNG INTERNATIONAL CONFERENCE ON SCIENCE, TECHNOLOGY, AND ENVIRONMENT (ULICoSTE) 2021

View full text Add to dashboard Cite

An algorithm to design finite automata that accept strings over input symbol a and b having exactly x number of a & y number of b

Cited by 7 publications

References 12 publications

Enhancing Card Swipe Machines using Mathematical Model with JFLAP Formal Methods and Automation: A Mathematical Model with JFLAP

Enhancing Card Swipe Machines using Mathematical Model with JFLAP Formal Methods and Automation: A Mathematical Model with JFLAP

Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings

Simple algorithm to construct deterministic finite automata from non-deterministic finite automata using initial state transitions successor

Contact Info

Product

Resources

About