Works matching IS 01290541 AND DT 2011 AND VI 22 AND IP 2
Results: 14
MAGIC NUMBERS AND TERNARY ALPHABET.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 331
- By:
- Publication type:
- Article
PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 447, doi. 10.1142/S0129054111008131
- By:
- Publication type:
- Article
ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 377, doi. 10.1142/S012905411100809X
- By:
- Publication type:
- Article
SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 395, doi. 10.1142/S0129054111008106
- By:
- Publication type:
- Article
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 275, doi. 10.1142/S0129054111008027
- By:
- Publication type:
- Article
THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES:: SOME TRACTABLE CASES.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 289, doi. 10.1142/S0129054111008040
- By:
- Publication type:
- Article
A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 277, doi. 10.1142/S0129054111008039
- By:
- Publication type:
- Article
CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 301, doi. 10.1142/S0129054111008052
- By:
- Publication type:
- Article
POWERS OF REGULAR LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 323, doi. 10.1142/S0129054111008064
- By:
- Publication type:
- Article
TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 411, doi. 10.1142/S0129054111008118
- By:
- Publication type:
- Article
A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 427, doi. 10.1142/S012905411100812X
- By:
- Publication type:
- Article
WORD EQUATIONS WITH ONE UNKNOWN.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 345, doi. 10.1142/S0129054111008088
- By:
- Publication type:
- Article
REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 473, doi. 10.1142/S0129054111008143
- By:
- Publication type:
- Article
ALGEBRAIC LINEAR ORDERINGS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 2, p. 491, doi. 10.1142/S0129054111008155
- By:
- Publication type:
- Article