메뉴 건너뛰기




Volumn 1254, Issue , 1997, Pages 155-166

Containment of regular languages in non-regular timing diagram languages is decidable

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; TIMING CIRCUITS;

EID: 84947440701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_17     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 3
    • 84987028346 scopus 로고
    • Consistency and satisfiability of waveform timhag specifications
    • J.A. Brzozowski, T. Gahlinger and F. Mavaddat, Consistency and satisfiability of waveform timhag specifications. Networks 21:91--107 1991.
    • (1991) Networks , vol.21
    • Brzozowski, J.A.1    Gahlinger, T.2    Mavaddat, F.3
  • 4
    • 2542625072 scopus 로고
    • Interface specifications with conjunctive timing constraints: Realizability and compatibility
    • E. Cerny and K. Khordoc. Interface specifications with conjunctive timing constraints: realizability and compatibility. In Second AMAST Workshop on Real-Time Systems June 1995.
    • (1995) Second AMAST Workshop on Real-Time Systems
    • Cerny, E.1    Khordoc, K.2
  • 7
    • 84976713661 scopus 로고
    • Ibarra. Reversal-bounded multicomlter machines and their decision problems
    • Oscar H, Ibarra. Reversal-bounded multicomlter machines and their decision problems. Journal of the ACM 25(1):116-133 January 1978.
    • (1978) Journal of the ACM , vol.25 , Issue.1 , pp. 116-133
    • Oscar, H.1


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