The following pages link to (Q4474160):
Displaying 10 items.
- Which security policies are enforceable by runtime monitors? A survey (Q465692) (← links)
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- Families of locally testable languages (Q1575558) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- A new algorithm for testing if a regular language is locally threshold testable (Q2380003) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES (Q3361892) (← links)
- (Q3484371) (← links)
- (Q3783588) (← links)
- (Q4782722) (← links)
