|
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;
ALGORITHMIC VERIFICATION;
FINITE STATE SYSTEMS;
LANGUAGE PROPERTY;
TIMING CONSTRAINTS;
TIMING DIAGRAMS;
TIMING PROPERTIES;
COMPUTABILITY AND DECIDABILITY;
|
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)
|