OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Induction of regular languages

 Home Mathematics Fields of mathematics Applied mathematics Theoretical computer science Computational learning theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Induction on regular languages typically refers to using mathematical induction to prove properties about regular languages or to establish algorithms and methods for working with these languages. Regular languages are those that can be represented by finite automata, regular expressions, or generated by regular grammars.

 Ancestors (6)

  1. Computational learning theory
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook