Entry Morita:1996:URT from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Morita:1996:URT,
author = "Kenichi Morita",
title = "Universality of a reversible two-counter machine",
journal = j-THEOR-COMP-SCI,
volume = "168",
number = "2",
pages = "303--320",
day = "20",
month = nov,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:25 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=168&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=168&issue=2&aid=2283",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
conflocation = "Paris, France; 28-30 March 1995",
conftitle = "International Workshop on Universal Machines and
Computations",
corpsource = "Dept. of Ind. and Syst. Eng., Hiroshima Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "$k$-counter machine; automata theory; automaton;
auxiliary memory; irreversible CM(k); reversible
two-counter machine; simulation; Turing machine; Turing
machines; universality",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- automaton,
138(1)101,
143(1)1,
143(1)23,
154(1)85,
155(2)291,
155(2)439,
156(1)145,
158(1)65,
167(1)73,
168(2)337,
168(2)367,
168(2)417,
169(2)123,
172(1)273,
176(1)1,
180(1)341,
183(1)93,
191(1)37,
191(1)61,
191(1)79,
205(1)297,
215(1)69,
226(1)143
- auxiliary,
141(1)163,
173(1)49
- counter,
149(1)67
- irreversible,
148(1)157,
197(1)242-2,
227(1)79
- memory,
140(1)179,
143(1)73,
147(1)1,
149(2)257,
155(2)349,
162(2)245,
165(2)311,
175(2)393,
180(1)341,
181(1)75,
186(1)199,
196(1)3,
196(1)109,
196(1)215,
196(1)365
- Morita, Kenichi,
148(1)157,
165(2)475,
168(2)337
- reversible,
138(1)67,
143(1)159,
148(1)157,
165(2)475,
168(2)337,
174(1)251,
197(1)242-2,
227(1)79
- simulation,
134(1)51,
138(1)67,
141(1)69,
143(1)123,
143(1)159,
148(1)157,
152(2)171,
153(1)3,
153(1)65,
154(1)23,
161(1)235,
162(2)245,
165(2)463,
168(2)417,
169(1)23,
169(1)39,
173(1)3,
174(1)123,
194(1)242-1,
196(1)109,
196(1)215,
197(1)157,
197(1)245,
197(1)246,
198(1)201,
217(1)131,
225(1)81
- Turing,
138(1)67,
143(1)123,
143(1)159,
145(1)111,
148(1)33,
148(2)325,
158(1)193,
161(1)301,
162(1)45,
168(2)215,
168(2)241,
168(2)257,
168(2)267,
168(2)321,
168(2)417,
168(2)461,
168(2)z,
172(1)135,
174(1)203,
174(1)217,
180(1)139,
180(1)229,
180(1)341,
181(1)119,
182(1)159,
191(1)215,
192(2)315,
194(1)137,
197(1)79,
210(1)217,
217(1)3,
411(31)2999
- universality,
168(2)267,
172(1)121,
175(1)3,
190(2)167