REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 831, doi. 10.1142/S0129054105003327
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2005 AND VI 16 AND IP 5
Results: 16
1
2
A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 985, doi. 10.1142/S012905410500342X
- By:
- Publication type:
- Article
3
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 829, doi. 10.1142/S0129054105003315
- Publication type:
- Article
4
RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 897, doi. 10.1142/S0129054105003364
- By:
- Publication type:
- Article
5
COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 851, doi. 10.1142/S0129054105003339
- By:
- Publication type:
- Article
6
ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 867, doi. 10.1142/S0129054105003340
- By:
- Publication type:
- Article
7
NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 883, doi. 10.1142/S0129054105003352
- By:
- Publication type:
- Article
8
ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 913, doi. 10.1142/S0129054105003376
- By:
- Publication type:
- Article
9
OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 929, doi. 10.1142/S0129054105003388
- By:
- Publication type:
- Article
10
NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 943, doi. 10.1142/S012905410500339X
- By:
- Publication type:
- Article
11
THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 957, doi. 10.1142/S0129054105003406
- By:
- Publication type:
- Article
12
DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 975, doi. 10.1142/S0129054105003418
- By:
- Publication type:
- Article
13
MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 999, doi. 10.1142/S0129054105003431
- By:
- Publication type:
- Article
14
MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 1027, doi. 10.1142/S0129054105003455
- By:
- Publication type:
- Article
15
ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 1011, doi. 10.1142/S0129054105003443
- By:
- Publication type:
- Article
16
BOND-FREE LANGUAGES:: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS.
- Published in:
- International Journal of Foundations of Computer Science, 2005, v. 16, n. 5, p. 1039, doi. 10.1142/S0129054105003467
- By:
- Publication type:
- Article