Entry Reedy:1975:TDI from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Reedy:1975:TDI,
author = "A. Reedy and W. J. Savitch",
title = "The {Turing} degree of the inherent ambiguity problem
for context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "1",
number = "1",
pages = "77--91",
month = jun,
year = "1975",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Div. of Math. Sci., Univ. of Iowa, Iowa City, IA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context free languages; context-free languages;
inherent ambiguity problem; r.e. sets; Turing degree;
Turing machine; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- automata,
1(2)95,
1(4)269,
1(4)297,
1(4)317,
2(1)1,
2(1)29,
2(1)49,
2(1)115,
2(2)147,
2(2)155,
2(3)271,
3(2)173,
3(2)213,
3(2)243,
3(2)261,
3(3)305,
4(2)143,
4(3)245,
5(2)101,
5(2)183,
6(1)1,
6(1)25,
6(2)175,
7(1)25,
7(2)149,
7(2)185,
7(3)311,
7(3)333,
8(2)227,
8(2)239,
8(2)255,
9(1)127,
9(1)141,
9(2)221,
9(2)311,
9(2)385
- C4220,
1(2)95,
1(4)269,
1(4)297,
1(4)317,
2(1)1,
2(1)29,
2(1)49,
2(1)115,
2(2)147,
2(2)155,
2(3)271,
3(2)173,
3(2)213,
3(2)243,
3(2)261,
3(3)305,
4(2)143,
4(3)245,
5(2)101,
5(2)183,
6(1)1,
6(1)25,
6(2)175,
7(2)149,
7(2)185,
7(3)311,
7(3)333,
8(2)227,
8(2)239,
8(2)255,
9(1)127,
9(1)141,
9(2)221,
9(2)311
- context,
2(1)49,
2(2)209,
2(3)295,
2(3)361,
3(3)273,
3(3)359,
4(1)83,
8(3)293,
8(3)395,
9(2)173
- context-free,
2(1)29,
2(2)209,
2(3)295,
2(3)361,
3(3)273,
3(3)359,
4(1)83,
6(3)255,
8(3)293,
8(3)395,
9(2)173
- degree,
2(1)73,
3(2)267
- free,
1(2)95,
1(4)297,
2(2)209,
2(3)295,
2(3)361,
3(2)243,
3(3)273,
3(3)359,
4(1)83,
6(3)255,
8(3)293,
8(3)395,
9(2)173
- free, context-,
2(1)29,
2(2)209,
2(3)295,
2(3)361,
3(3)273,
3(3)359,
4(1)83,
6(3)255,
8(3)293,
8(3)395,
9(2)173
- machine,
1(2)125,
1(4)269,
1(4)297,
2(1)1,
2(1)73,
2(2)183,
2(3)345,
3(2)213,
3(3)305,
6(1)1,
6(1)25,
6(2)175,
7(2)185,
7(3)311,
8(2)227,
8(2)239,
9(1)127
- problem,
1(3)237,
1(4)297,
2(1)77,
2(3)361,
3(1)1,
3(1)75,
3(1)85,
3(1)105,
3(2)123,
3(2)183,
3(3)283,
3(3)293,
4(1)99,
4(2)137,
4(3)237,
4(3)245,
4(3)277,
5(2)179,
6(1)93,
6(2)223,
6(3)317,
7(1)25,
7(2)149,
7(2)169,
8(1)1,
8(1)89,
8(2)135,
8(2)189,
9(2)173,
9(2)377
- set,
1(4)331,
2(1)77,
2(3)383,
3(1)23,
4(1)99,
4(2)125,
5(2)179,
5(2)183,
5(3)257,
6(3)233,
7(3)273,
7(3)311,
8(1)13,
8(2)135,
8(3)271,
8(3)379,
9(1)141,
9(2)153,
9(2)207
- Turing,
1(2)103,
1(3)215,
2(1)73,
3(2)213,
6(1)1,
6(1)25,
6(2)175,
7(2)185,
8(2)227,
8(2)239,
9(1)127,
9(2)311