Pages that link to "Item:Q4327417"
From MaRDI portal
The following pages link to Computing the Order of a Locally Testable Automaton (Q4327417):
Displaying 12 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)
- On the bound of the synchronization delay of a local automaton (Q1275089) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← 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)
- Regular splicing languages and subclasses (Q2484444) (← links)
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES (Q3021987) (← links)
- ON FREE SPECTRA OF LOCALLY TESTABLE SEMIGROUP VARIETIES (Q3094646) (← links)
- (Q3484371) (← links)
- Identities of locally testable semigroups (Q4700477) (← links)
- An efficient algorithm for local testability problem of finite state automata (Q6085759) (← links)