Complement (computer languages)/Definition: Difference between revisions
Jump to navigation
Jump to search
imported>Howard C. Berkowitz (New page: <noinclude>{{Subpages}}</noinclude> A term used in Regular Language to describe sets of closed languages, which can be accepted by a finite automaton, neeting the criterion <math>\...) |
imported>Howard C. Berkowitz m (Complenent (computer languages)/Definition moved to Complement (computer languages)/Definition: Typo again) |
(No difference)
|
Latest revision as of 22:31, 22 October 2008
This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.
Complement (computer languages) [r]: A term used in Regular Language to describe sets of closed languages, which can be accepted by a finite automaton, neeting the criterion