Answer by Bader Abu Radi for Notation in NFA, DFA diagrams and language
Consider a finite nonempty alphabet $\Sigma$. The set $\Sigma^* = \bigcup\limits_{n\geq 0 } \Sigma^n$ is the set of finite words over $\Sigma$, indeed, for all $n\geq 0$, we define $\Sigma^n$ as the...
View ArticleAnswer by reinierpost for Notation in NFA, DFA diagrams and language
You need to distinguish between three kinds of operations:Operations on numbers such as 0 and 1. $0^3 = 0$ when $0$ is taken to be a number. Here, $0^3 = 0 ⋅ 0 ⋅ 0$, where $⋅$ is integer...
View ArticleAnswer by Knogger for Notation in NFA, DFA diagrams and language
For a (usually finite) set $A$ the star denotes the free monoid on $A$ where$$A^* = \{a_1a_2...a_k : k \geq 0 \land \forall i. a_i \in A\}$$is the set of all finite sequences or strings of elements in...
View ArticleClik here to view.
Notation in NFA, DFA diagrams and language
I've only recently started learning about deterministic/nondeterministic finite automata and languages and I'd like some clarification on common notation used to describe languages. A 0 or 1 raised to...
View Article
