Methods of the algebraic theory of machines
Journal of Computer and System Sciences
Generalized2 sequential machine maps
Journal of Computer and System Sciences
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Learning Context-Sensitive Languages from Linear Structural Information
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Properties of code events and homomorphisms over regular events
Journal of Computer and System Sciences
Smoothing and compression with stochastic k-testable tree languages
Pattern Recognition
Classifying melodies using tree grammars
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Malware analysis with tree automata inference
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Learning analysis by reduction from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Recognizing malicious software behaviors with tree automata inference
Formal Methods in System Design
| Hi-index | 0.00 |
This paper studies the locally testable languages (or ''events'') introduced by McNaughton and Papert. We characterize these languages by means of their syntactic semigroups and obtain wreath product and direct product decompositions for these semigroups. As a by-product of our study, we find an algebraic characterization of A. Ginzburg's generalized definite languages.