scientific article; zbMATH DE number 140486
From MaRDI portal
Publication:4028905
Recommendations
- scientific article; zbMATH DE number 2081053
- scientific article; zbMATH DE number 4155920
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- scientific article; zbMATH DE number 1962781
- Reducing the time complexity of testing for local threshold testability
Cited in
(17)- On the bound of the synchronization delay of a local automaton
- Families of locally testable languages
- Optimal estimation on the order of local testability of finite automata
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- A characterization of constant-time cellular automata computation
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
- scientific article; zbMATH DE number 4155920 (Why is no real title available?)
- scientific article; zbMATH DE number 4047135 (Why is no real title available?)
- A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
- scientific article; zbMATH DE number 512840 (Why is no real title available?)
- Computing the Order of a Locally Testable Automaton
- scientific article; zbMATH DE number 1962781 (Why is no real title available?)
- scientific article; zbMATH DE number 2081053 (Why is no real title available?)
- scientific article; zbMATH DE number 1472161 (Why is no real title available?)
- scientific article; zbMATH DE number 1839456 (Why is no real title available?)
- A probabilistic algorithm to test local algebraic observability in polynomial time
- An efficient algorithm for local testability problem of finite state automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028905)
