Pages that link to "Item:Q5375412"
From MaRDI portal
The following pages link to A polynomial time algorithm for the local testability problem of deterministic finite automata (Q5375412):
Displaying 18 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)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Algebraic method for generation of locally trivial tests (Q920941) (← links)
- Families of locally testable languages (Q1575558) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
- LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES (Q3361892) (← links)
- (Q3484371) (← links)
- (Q3783588) (← links)
- (Q4474160) (← links)
- (Q4782722) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5892265) (← links)
- Free profinite locally idempotent and locally commutative semigroups (Q5946464) (← links)
- An efficient algorithm for local testability problem of finite state automata (Q6085759) (← links)
