2018•Advances in intelligent systems and computingRequires access

Implementation of Equivalence of Deterministic Finite-State Automation and Non-deterministic Finite-State Automaton in Acceptance of Type 3 Languages Using Programming Code

Rinku, Chetan Sharma, Ajay Kumar Rangra, Manish Kumar, Aman Madaan

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Deterministic automaton, Deterministic finite automaton, Two-way deterministic finite automaton, Nondeterministic finite automaton, Finite-state machine, Büchi automaton, DFA minimization, Computer science

Back to paper search Browse research topics Original source

Implementation of Equivalence of Deterministic Finite-State Automation and Non-deterministic Finite-State Automaton in Acceptance of Type 3 Languages Using Programming Code — Research Paper | ScholarLens