Entry Chang:1986:PA from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
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{Chang:1986:PA,
author = "J. H. Chang and O. H. Ibarra and M. A. Palis and B.
Ravikumar",
title = "On pebble automata",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "111--121",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic checking stack automata; formal
languages; halting; language families; pebble automata;
recognition power; space-bounded Turing machines; TMs;
Turing machines; two-way deterministic pushdown
automata",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bounded, space-,
68(1)19
- Chang, J. H.,
39(2)89,
68(1)19
- checking,
39(2)267,
46(2)197,
64(1)39,
64(3)305
- deterministic,
35(2)215,
36(1)89,
37(1)1,
37(2)123,
38(1)133,
38(2)323,
40(1)31,
40(1)57,
41(2)223,
41(2)305,
41(2)325,
42(3)251,
43(2)123,
43(2)337,
46(2)219,
47(1)39,
47(2)149,
48(1)109,
48(1)117,
49(2)267,
52(1)77,
52(1)91,
52(3)269,
54(1)65,
61(1)25,
61(2)149,
64(1)39,
66(1)65,
66(3)273,
67(1)65
- family,
36(2)345,
39(2)239,
39(2)281,
54(2)165,
55(2)183,
58(1)69,
60(3)341,
61(2)175,
63(1)19,
63(2)157,
67(1)111,
68(2)155
- halting,
54(2)325
- Ibarra, O. H.,
39(2)89,
41(2)231,
57(1)47,
57(2)225,
68(1)19
- Palis, M. A.,
39(2)89,
41(2)231,
57(1)47,
68(1)19
- pebble,
47(2)205,
58(1)209
- power,
36(1)1,
36(1)127,
39(2)267,
40(1)13,
41(1)51,
41(1)109,
44(1)1,
46(2)285,
47(1)15,
50(3)285,
53(2)187,
54(2)331,
56(1)135,
57(1)147,
57(2)225,
60(1)83,
62(3)289,
62(3)319,
65(1)35,
65(2)131,
67(2)143,
69(1)1
- pushdown,
37(1)51,
37(2)123,
39(2)89,
39(2)267,
40(2)163,
41(2)223,
42(3)251,
48(2)153,
58(1)69,
61(2)149,
64(1)39,
67(1)75
- recognition,
35(2)271,
39(2)89,
41(2)231,
43(1)31,
43(2)239,
43(2)315,
47(3)315,
48(2)145,
52(3)177,
57(1)97,
60(3)231,
60(3)341,
63(1)1,
63(2)203,
64(1)107,
66(1)99,
68(2)155
- space-bounded,
68(1)19
- stack,
39(2)267,
52(1)91,
58(1)69,
63(3)303
- TMs,
68(1)19
- Turing,
35(2)191,
35(2)215,
36(2)341,
37(1)1,
40(2)175,
41(2)331,
43(1)43,
43(1)107,
44(1)1,
47(2)131,
47(3)237,
51(3)265,
52(1)15,
52(3)251,
52(3)341,
53(2)307,
54(2)325,
54(2)331,
55(2)291,
57(1)47,
58(1)175,
58(1)263,
61(2)149,
66(3)289,
67(1)5,
67(1)99,
68(1)19,
68(2)123
- two-way,
35(1)115,
39(2)267,
47(2)149,
63(2)141,
66(3)273
- way, two-,
35(1)115,
39(2)267,
47(2)149,
63(2)141,
66(3)273