A polynomial time algorithm for the local testability problem of deterministic finite automata
From MaRDI portal
Publication:5375412
Cited in
(18)- scientific article; zbMATH DE number 2081053 (Why is no real title available?)
- Which security policies are enforceable by runtime monitors? A survey
- scientific article; zbMATH DE number 1839456 (Why is no real title available?)
- Algebraic method for generation of locally trivial tests
- scientific article; zbMATH DE number 4155920 (Why is no real title available?)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- scientific article; zbMATH DE number 4047135 (Why is no real title available?)
- Families of locally testable languages
- Optimal estimation on the order of local testability of finite automata
- Checking whether an automaton is monotonic is NP-complete
- Execution monitoring enforcement under memory-limitation constraints
- An efficient algorithm for local testability problem of finite state automata
- A probabilistic algorithm to test local algebraic observability in polynomial time
- Local testability from words to traces, a suitable definition
- LANGAGE: A Maple package for automaton characterization of regular languages
- Free profinite locally idempotent and locally commutative semigroups
- Reducing the time complexity of testing for local threshold testability
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
This page was built for publication: A polynomial time algorithm for the local testability problem of deterministic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375412)
