메뉴 건너뛰기





Volumn , Issue , 1995, Pages 229-234

Implicit prime compatible generation for minimizing incompletely specified finite state machines

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; SEQUENTIAL MACHINES; SET THEORY; THEOREM PROVING;

EID: 0029541553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (9)
  • Reference 정보가 존재하지 않습니다.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.