Works matching IS 01290541 AND DT 2010 AND VI 21 AND IP 4
Results: 12
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 477, doi. 10.1142/S0129054110007374
- By:
- Publication type:
- Article
ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 479, doi. 10.1142/S0129054110007386
- By:
- Publication type:
- Article
THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 495, doi. 10.1142/S0129054110007398
- By:
- Publication type:
- Article
HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 517, doi. 10.1142/S0129054110007404
- By:
- Publication type:
- Article
NUMBER OF OCCURRENCES OF POWERS IN STRINGS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 535, doi. 10.1142/S0129054110007416
- By:
- Publication type:
- Article
VARIANTS OF COMPETENCE-BASED DERIVATIONS IN CD GRAMMAR SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 549, doi. 10.1142/S0129054110007428
- By:
- Publication type:
- Article
TREE AUTOMATA WITH GLOBAL CONSTRAINTS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 571, doi. 10.1142/S012905411000743X
- By:
- Publication type:
- Article
FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 597, doi. 10.1142/S0129054110007441
- By:
- Publication type:
- Article
A TAXONOMY OF DETERMINISTIC FORGETTING AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 619, doi. 10.1142/S0129054110007453
- By:
- Publication type:
- Article
ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 633, doi. 10.1142/S0129054110007465
- By:
- Publication type:
- Article
BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 647, doi. 10.1142/S0129054110007477
- By:
- Publication type:
- Article
UNAMBIGUOUS SHARED-MEMORY SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 4, p. 665, doi. 10.1142/S0129054110007489
- By:
- Publication type:
- Article