An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Piecewise and Local Threshold Testability of DFA
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Bilateral locally testable languages
Theoretical Computer Science
A new algorithm for testing if a regular language is locally threshold testable
Information Processing Letters
Execution monitoring enforcement under memory-limitation constraints
Information and Computation
Execution monitoring enforcement for limited-memory systems
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Regular ideal languages and their boolean combinations
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Subshifts as models for MSO logic
Information and Computation
| Hi-index | 5.23 |