STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Reducing the time complexity of testing for local threshold testability
Theoretical Computer Science - Implementation and application of automata
A new algorithm for testing if a regular language is locally threshold testable
Information Processing Letters
ACM Computing Surveys (CSUR)
A Decidable Characterization of Locally Testable Tree Languages
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
A package TESTAS for checking some kinds of testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Reducing the time complexity of testing for local threshold testability
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Automata vs. logics on data words
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A toolkit for proving limitations of the expressive power of logics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |