Works matching IS 01290541 AND DT 2016 AND VI 27 AND IP 5
Results: 8
Subset Synchronization and Careful Synchronization of Binary Finite Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 557, doi. 10.1142/S0129054116500167
- By:
- Publication type:
- Article
Parikh Matrices and Strong M-Equivalence.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 545, doi. 10.1142/S0129054116500155
- By:
- Publication type:
- Article
Belated Analyses of Three Credit-Based Adaptive Polling Algorithms.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 579, doi. 10.1142/S0129054116500179
- By:
- Publication type:
- Article
Algorithms for Longest Common Abelian Factors.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 529, doi. 10.1142/S0129054116500143
- By:
- Publication type:
- Article
Self-Stabilizing Prefix Tree Based Overlay Networks.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 607, doi. 10.1142/S0129054116500192
- By:
- Publication type:
- Article
Secret Sharing Schemes from Linear Codes over.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 595, doi. 10.1142/S0129054116500180
- By:
- Publication type:
- Article
Abelian Complexity and Frequencies of Letters in Infinite Words.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 631, doi. 10.1142/S0129054116500209
- By:
- Publication type:
- Article
Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]".
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 651, doi. 10.1142/S0129054116940018
- By:
- Publication type:
- Article