Formal Languages set is superset of Regular Languages set"?
Solution:
· it can be accepted by a deterministic finite state machine.
· it can be accepted by a nondeterministic finite state machine
· it can be accepted by an alternating finite automaton
· it can be described by a formal regular expression. Note that the "regular expression" features provided with many programming languages are augmented with features that make them capable of recognizing languages which are not regular, and are therefore not strictly equivalent to formal regular expressions.
· it can be generated by a regular grammar
· it can be generated by a prefix grammar
· it can be accepted by a read-only Turing machine
· it can be defined in monadic second-order logic
· it is recognized by some finitely generated monoid
· it is the preimage of a subset of a finite monoid under a homomorphism from the free monoid on its alphabet
Second:
A formal language is basically a set of words over some alphabet. A regular language is a formal language with specific constraints. you're saying "regular languages are a subset of formal languages".