Search results

Page title matches

• Regular Language
  * <math>A</math> is a regular language. ...phic images and preimages. Suppose <math>C \subseteq \Gamma^*</math> is a regular language and <math>h : \Sigma^* \to \Gamma^*</math> is a [[string homomorphism]]. T
  2 KB (270 words) - 23:28, 22 October 2008
• Regular Language/Definition
  100 bytes (14 words) - 22:36, 22 June 2008
• Regular Language/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Regular Language]]. Needs checking by a human.
  487 bytes (60 words) - 19:57, 11 January 2010

Page text matches

• String (computer science)
  #REDIRECT [[Regular Language]]
  30 bytes (3 words) - 15:36, 10 December 2008
• Regular Language
  * <math>A</math> is a regular language. ...phic images and preimages. Suppose <math>C \subseteq \Gamma^*</math> is a regular language and <math>h : \Sigma^* \to \Gamma^*</math> is a [[string homomorphism]]. T
  2 KB (270 words) - 23:28, 22 October 2008
• Complement (computer languages)/Definition
  A term used in [[Regular Language]] to describe sets of closed languages, which can be accepted by a [[finite
  238 bytes (37 words) - 23:31, 22 October 2008
• Regular expression/Related Articles
  {{r|Regular Language}}
  572 bytes (76 words) - 19:58, 11 January 2010
• Regular Language/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Regular Language]]. Needs checking by a human.
  487 bytes (60 words) - 19:57, 11 January 2010