Works matching IS 01290541 AND DT 2008 AND VI 19 AND IP 3
Results: 14
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 495, doi. 10.1142/S0129054108005784
- By:
- Publication type:
- Article
APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 497, doi. 10.1142/S0129054108005796
- By:
- Publication type:
- Article
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 513, doi. 10.1142/S0129054108005802
- By:
- Publication type:
- Article
EQUIVALENCE OF LABELED MARKOV CHAINS.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 549, doi. 10.1142/S0129054108005814
- By:
- Publication type:
- Article
NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 565, doi. 10.1142/S0129054108005826
- By:
- Publication type:
- Article
STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 581, doi. 10.1142/S0129054108005838
- By:
- Publication type:
- Article
CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 597, doi. 10.1142/S012905410800584X
- By:
- Publication type:
- Article
DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 617, doi. 10.1142/S0129054108005851
- By:
- Publication type:
- Article
AVOIDING APPROXIMATE SQUARES.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 633, doi. 10.1142/S0129054108005863
- By:
- Publication type:
- Article
FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 649, doi. 10.1142/S0129054108005875
- By:
- Publication type:
- Article
ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 677, doi. 10.1142/S0129054108005887
- By:
- Publication type:
- Article
ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 691, doi. 10.1142/S0129054108005899
- By:
- Publication type:
- Article
THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 717, doi. 10.1142/S0129054108005905
- By:
- Publication type:
- Article
TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS.
- Published in:
- International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 729, doi. 10.1142/S0129054108005917
- By:
- Publication type:
- Article