(definition)
Definition: A set of strings over some fixed alphabet. A characterization of inputs which may or may not be solved by algorithms.
Also known as formal language.
See also decidable language, undecidable problem.
Note: From Algorithms and Theory of Computation Handbook, page 24-19, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:05:06 2004.
HTML page formatted Wed Oct 26 09:47:43 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "language", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/language.html
