State Complexity Upper Bound of Combined Operations for Suffix-Free Regular Languages

후위부자유 정규언어의 복합 연산 상계 상태복잡도

  • Eom, Hae-Sung (Department of Computer Science, Yonsei University) ;
  • Han, Yo-Sub (Department of Computer Science, Yonsei University)
  • 엄해성 (연세대학교 컴퓨터과학과) ;
  • 한요섭 (연세대학교 컴퓨터과학과)
  • Published : 2010.11.05