Skip to search formSkip to main contentSkip to account menu

Union of two regular languages

Known as: Nondeterministic finite state machine/Union of two regular languages is regular 
In formal language theory, and in particular the theory of nondeterministic finite automata, it is known that the union of two regular languages is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Formal languageNondeterministic finite automatonRegular language

Search for papers about Union of two regular languages

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)