An efficient algorithm for local testability problem of finite state automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 140486
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- scientific article; zbMATH DE number 4155920
- Optimal estimation on the order of local testability of finite automata
- scientific article; zbMATH DE number 2081053
Cites work
- A polynomial time algorithm for the local testability problem of deterministic finite automata
- Algebraic decision procedures for local testability
- Characterizations of locally testable events
- Computing the Order of a Locally Testable Automaton
- Depth-First Search and Linear Graph Algorithms
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Locally testable languages
Cited in
(6)- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- scientific article; zbMATH DE number 4155920 (Why is no real title available?)
- scientific article; zbMATH DE number 4047135 (Why is no real title available?)
- scientific article; zbMATH DE number 2081053 (Why is no real title available?)
- scientific article; zbMATH DE number 1839456 (Why is no real title available?)
- Local encoding transformations for optimizing OBDD-representations of finite state machines
This page was built for publication: An efficient algorithm for local testability problem of finite state automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085759)
