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 regular language. This article provides a proof of that statement.
Read more about Union Of Two Regular Languages: Theorem
Famous quotes containing the words union, regular and/or languages:
“The only hope of socialism resides in those who have already brought about in themselves, as far as is possible in the society of today, that union between manual and intellectual labor which characterizes the society we are aiming at.”
—Simone Weil (1909–1943)
“He hung out of the window a long while looking up and down the street. The world’s second metropolis. In the brick houses and the dingy lamplight and the voices of a group of boys kidding and quarreling on the steps of a house opposite, in the regular firm tread of a policeman, he felt a marching like soldiers, like a sidewheeler going up the Hudson under the Palisades, like an election parade, through long streets towards something tall white full of colonnades and stately. Metropolis.”
—John Dos Passos (1896–1970)
“It is time for dead languages to be quiet.”
—Natalie Clifford Barney (1876–1972)