HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 815, doi. 10.1142/S0129054113400200
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2013 AND VI 24 AND IP 6
Results: 16
1
2
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 689, doi. 10.1142/S0129054113020036
- By:
- Publication type:
- Article
3
THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 921, doi. 10.1142/S0129054113500275
- By:
- Publication type:
- Article
4
HOW TO SYNCHRONIZE THE HEADS OF A MULTITAPE AUTOMATON.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 799, doi. 10.1142/S0129054113400194
- By:
- Publication type:
- Article
5
SELF STABILIZATION IN DISTRIBUTED KNOT DETECTION.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 913, doi. 10.1142/S0129054113500263
- By:
- Publication type:
- Article
6
RESTARTING TILING AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 863, doi. 10.1142/S0129054113400236
- By:
- Publication type:
- Article
7
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 691, doi. 10.1142/S0129054113400133
- By:
- Publication type:
- Article
8
RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 879, doi. 10.1142/S012905411350024X
- By:
- Publication type:
- Article
9
ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 831, doi. 10.1142/S0129054113400212
- By:
- Publication type:
- Article
10
P(L)AYING FOR SYNCHRONIZATION.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 765, doi. 10.1142/S0129054113400170
- By:
- Publication type:
- Article
11
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 781, doi. 10.1142/S0129054113400182
- By:
- Publication type:
- Article
12
ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 847, doi. 10.1142/S0129054113400224
- By:
- Publication type:
- Article
13
WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 709, doi. 10.1142/S0129054113400145
- By:
- Publication type:
- Article
14
A NEW UPPER BOUND FOR RANDOM (2 + p)-SAT BY FLIPPING TWO VARIABLES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 899, doi. 10.1142/S0129054113500251
- By:
- Publication type:
- Article
15
SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 729, doi. 10.1142/S0129054113400157
- By:
- Publication type:
- Article
16
STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES.
- Published in:
- International Journal of Foundations of Computer Science, 2013, v. 24, n. 6, p. 747, doi. 10.1142/S0129054113400169
- By:
- Publication type:
- Article