Computer Science ›› 2006, Vol. 33 ›› Issue (11): 272-273.

Previous Articles     Next Articles

  

  • Online:2018-11-17 Published:2018-11-17

Abstract: Some languages are made of the digit strings which can be divided by interger numb N. It is diffict to make the automaton to accept the language. Based on the equivalence class, we present the method of using equivalence to make the automaton. It can be u

Key words: Equivalence relation, Equivalence class,Finite state automaton

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!