Search

Your search keyword '"Nur Ain Ebas"' showing total 5 results
Start Over Author "Nur Ain Ebas"
5 results on '"Nur Ain Ebas"'

1. Neutrosophic General Finite Automata

Author

J. Kavikumar, D. Nagarajan, Said Broumi, F. Smarandache, M. Lathamaheswari, and Nur Ain Ebas

Subjects
Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95
Abstract

The constructions of finite switchboard state automata is known to be an extension of finite automata in the view of commutative and switching automata. In this research, the idea of a neutrosophic is incorporated in the general fuzzy finite automata and general fuzzy finite switchboard automata to introduce neutrosophic general finite automata and neutrosophic general finite switchboard automata. Moreover, we define the notion of the neutrosophic subsystem and strong neutrosophic subsystem for both structures. We also establish the relationship between the neutrosophic subsystem and neutrosophic strong subsystem.

Published
2019
Full Text
View/download PDF

4. General Fuzzy Finite Switchboard Automata

Author

Nur Ain Ebas, J. Kavikumar, A. H. Nor Shamsidah, and Surya Prakash Tiwari

Subjects
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Finite-state machine, Mathematics::General Mathematics, Computer science, Applied Mathematics, 010102 general mathematics, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), Extension (predicate logic), Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Fuzzy logic, Computer Science Applications, Automaton, 010101 applied mathematics, Human-Computer Interaction, Algebra, Computational Mathematics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, Homomorphism, State (computer science), 0101 mathematics, Commutative property, Computer Science::Formal Languages and Automata Theory, Topology (chemistry)
Abstract

The constructions of finite switchboard state automata are known to be an extension of finite automata in the view of commutative and switching state machines. This research incorporated an idea of a switchboard in the general fuzzy automata to introduce general fuzzy finite switchboard automata. The attained output reveals that a strongly connected general fuzzy finite switchboard automaton is equivalent to the retrievable general fuzzy automata. Further, the notion of the switchboard subsystem and strong switchboard subsystem of general fuzzy finite switchboard automata are examined. Finally, the concept of fuzzy topology on general fuzzy finite switchboard automata in terms of these characterisations is formulated.

Published
2019

5. Algebraic properties of finite switchboard state machine

Author

Nor Shamsidah Amir Hamzah, Rosmila Abdul-Kahar, Kavikumar Jacob, Nur Ain Ebas, Noor’ani Ahmad, Mohd Saifullah Rusiman, and Fatin Shahirah Othman

Subjects
Algebraic properties, Algebra, Finite-state machine, Computer science, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), Algebraic number
Abstract

A finite switchboard state machine is a specialized finite state machine. The algebraic approach of finite switchboard state machine is still lacking in literature. In this paper, we applied the algebraic approach of finite switchboard state machine and study its related properties. Real life examples of the applications are given by discussing the algebraic properties used.

Published
2018

Catalog

Books, media, physical & digital resources
See catalog results