BOUNDED PARIKH AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1691, doi. 10.1142/S0129054112400709
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2012 AND VI 23 AND IP 8
Results: 13
1
2
CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1595, doi. 10.1142/S0129054112400643
- By:
- Publication type:
- Article
3
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1579, doi. 10.1142/S0129054112020091
- By:
- Publication type:
- Article
4
ON PANSIOT WORDS AVOIDING 3-REPETITIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1583, doi. 10.1142/S0129054112400631
- By:
- Publication type:
- Article
5
UNARY PATTERNS WITH INVOLUTION.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1641, doi. 10.1142/S0129054112400679
- By:
- Publication type:
- Article
6
AUTHOR INDEX VOLUME 23 (2012).
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1767, doi. 10.1142/S0129054112990018
- Publication type:
- Article
7
EQUALITY SETS OF MORPHIC WORD SEQUENCES.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1749, doi. 10.1142/S0129054112500268
- By:
- Publication type:
- Article
8
CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1729, doi. 10.1142/S0129054112500256
- By:
- Publication type:
- Article
9
SUBSTITUTIONS OVER INFINITE ALPHABET GENERATING (− β)-INTEGERS.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1627, doi. 10.1142/S0129054112400667
- By:
- Publication type:
- Article
10
THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1611, doi. 10.1142/S0129054112400655
- By:
- Publication type:
- Article
11
FULL MONOIDS AND MAXIMAL CODES.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1677, doi. 10.1142/S0129054112400692
- By:
- Publication type:
- Article
12
PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1653, doi. 10.1142/S0129054112400680
- By:
- Publication type:
- Article
13
FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2012, v. 23, n. 8, p. 1711, doi. 10.1142/S0129054112400710
- By:
- Publication type:
- Article