2020
DOI: 10.15575/join.v5i2.630
|View full text |Cite
|
Sign up to set email alerts
|

Mobile Learning Application for Language and Automata Theory using Android-based

Abstract: The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important materials in language and automata theory. This material requires more understanding of mathematical logic from students to determine an input which can be accepted or rejected in an abstract machine system. The assist students  to understand the material, it is ne… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 1 publication
0
0
0
Order By: Relevance
“…∑ = Set of input symbols c. δ= transition function d. S = Beginning of state e. S ϵ QF= The set of the final set f. F ∩ Q = Number of final states FSA is divided into two types, namely DFA and NFA. DFA is a state where exactly one state is the next each symbol input received [10] while NFA is a state that has more than one transitional direction between states [11].…”
Section: Introductionmentioning
confidence: 99%
“…∑ = Set of input symbols c. δ= transition function d. S = Beginning of state e. S ϵ QF= The set of the final set f. F ∩ Q = Number of final states FSA is divided into two types, namely DFA and NFA. DFA is a state where exactly one state is the next each symbol input received [10] while NFA is a state that has more than one transitional direction between states [11].…”
Section: Introductionmentioning
confidence: 99%