PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 803, doi. 10.1142/S012905411402002X
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2014 AND VI 25 AND IP 7
Results: 8
1
2
ITERATION OF INVERTIBLE TRANSDUCTIONS.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 857, doi. 10.1142/S0129054114400127
- By:
- Publication type:
- Article
3
DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 917, doi. 10.1142/S0129054114400152
- By:
- Publication type:
- Article
4
LIMITED AUTOMATA AND REGULAR LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 897, doi. 10.1142/S0129054114400140
- By:
- Publication type:
- Article
5
NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 823, doi. 10.1142/S0129054114400103
- By:
- Publication type:
- Article
6
SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 877, doi. 10.1142/S0129054114400139
- By:
- Publication type:
- Article
7
NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 837, doi. 10.1142/S0129054114400115
- By:
- Publication type:
- Article
8
SYNTACTIC COMPLEXITY OF ℛ- AND 풥-TRIVIAL REGULAR LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 7, p. 807, doi. 10.1142/S0129054114400097
- By:
- Publication type:
- Article