Regular language
A regular language is a formal language that satisfies the following equivalent properties:
* 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 regular expression
Discussions
|
Discussion
Features
|
|
 |
Ask a
question about 'Regular language' |
|
|
 |
|
 |
Start a new
discussion about 'Regular language' |
|
|
|
|
 |
Answer
questions about 'Regular language' |
|
|
|
|
 |
'Regular language' discussion
forum |
|
|
Encyclopedia
A
regular language is a formal language that satisfies the following equivalent properties:
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 regular expression
