Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Information and Control -- 1982
Louise
Hay. On the recursion-theoretic complexity of relative succinctness
of representations of languages. Information and Control,
52(1):2-7, January 1982.
References.
[BibTeX entry]
W.
Menzel and V.
Sperschneider. Universal automata with uniform bounds on simulation
time. Information and Control, 52(1):19-35, January 1982.
[BibTeX entry]
Etsuji Tomita. A direct
branching algorithm for checking equivalence of some classes of
deterministic pushdown automata. Information and Control,
52(2):187-238, February 1982.
References.
[BibTeX entry]
P. L.
Butzer and W. Engels.
Dyadic calculus and sampling theorems for functions with
multidimensional domain. I: General theory. Information and
Control, 52(3):333-351, March 1982.
[BibTeX entry]
P. L.
Butzer and W. Engels.
Dyadic calculus and sampling theorems for functions with
multidimensional domain. II: Applications to dyadic sampling
representations. Information and Control, 52(3):352-363,
March 1982.
References.
[BibTeX entry]
Prem
Nath and Man Mohan
Kaur. On some characterizations of the shannon entropy using extreme
symmetry and block symmetry. Information and Control,
53(1/2):9-20, April/May 1982.
[BibTeX entry]
Ker-I Ko.
Some negative results on the computational complexity of total variation
and differentiation. Information and Control,
53(1/2):21-31, April/May 1982.
References.
[BibTeX entry]
Nariyasu Minamide. An
extension of the entropy theorem for parameter estimation.
Information and Control, 53(1/2):81-90, April/May 1982.
References.
[BibTeX entry]
Howard A. Blair. The
recursion-theoretical complexity of the semantics of predicate logic as
a programming language. Information and Control,
54(1/2):25-47, July/August 1982.
References
and Citations.
[BibTeX entry]
Stathis Zachos. Robustness of
probabilistic computational complexity classes under definitional
perturbations. Information and Control, 54(3):143-154,
September 1982.
References
and Citations.
[BibTeX entry]
Pavol Duris and Zvi Galil. On reversal-bounded
counter machines and on pushdown automata with a bound on the size of
their pushdown store. Information and Control,
54(3):217-227, September 1982.
References.
[BibTeX entry]
Hans-Ulrich Simon. A tight
\Omega(log log n)-bound on the time for parallel RAM's to compute
nondegenerated Boolean functions. Information and Control,
55(1-3):102-106, October/November/December 1982.
References
and Citations.
[BibTeX entry]
Ian F.
Blake. The enumeration of certain run-length sequences.
Information and Control, 55(1-3):222-236,
October/November/December 1982.
References.
[BibTeX entry]
D.
L. Neuhoff and P. C.
Shields. Channel distances and representation. Information and
Control, 55(1-3):238-264, October/November/December 1982.
[BibTeX entry]