Additional Properties of Finite State Transducers
- It is decidable whether the relation of a transducer T is empty.
- It is decidable whether there exists a string y such that xy for a given string x.
- It is undecidable whether two transducers are equivalent.
- If one defines the alphabet of labels, finite state transducers are isomorphic to NDFA over the alphabet, and may therefore be determinized (turned into deterministic finite automata over the alphabet ) and subsequently minimized so that they have the minimum number of states.
Read more about this topic: Finite State Transducer
Famous quotes containing the words additional, properties, finite and/or state:
“Dog. A kind of additional or subsidiary Deity designed to catch the overflow and surplus of the world’s worship.”
—Ambrose Bierce (1842–1914)
“A drop of water has the properties of the sea, but cannot exhibit a storm. There is beauty of a concert, as well as of a flute; strength of a host, as well as of a hero.”
—Ralph Waldo Emerson (1803–1882)
“Are not all finite beings better pleased with motions relative than absolute?”
—Henry David Thoreau (1817–1862)
“The society would permit no books of fiction in its collection because the town fathers believed that fiction ‘worketh abomination and maketh a lie.’”
—For the State of Rhode Island, U.S. public relief program (1935-1943)