Entry Gohon:1985:ADW 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{Gohon:1985:ADW,
author = "P. Gohon",
title = "An algorithm to decide whether a rational subset of
{$N^k$} is recognizable",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "51--59",
month = "????",
year = "1985",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Lab. d'Inf., Univ. de Haute-Normandie, Mt.St. Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; decidability; formal power
series; rational subset; series (mathematics); set
theory; unambiguous rational expression",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
Related entries
- context-free,
35(1)1,
35(2)191,
35(2)295,
35(2)313,
36(1)89,
36(1)109,
37(2)217,
37(3)357,
38(1)133,
38(2)323,
39(1)3,
39(1)z,
39(2)89,
40(2)131,
40(2)149,
40(2)315,
41(1)1,
41(1)33,
41(1)105,
41(2)169,
41(2)231,
42(1)1,
44(2)229,
44(3)259,
45(1)87,
46(1)83,
47(1)71,
47(1)95,
47(1)107,
47(2)219,
47(2)225,
47(3)247,
47(3)315,
48(1)101,
48(2)201,
48(2)283,
49(1)23,
49(2)113,
49(2)283,
51(1)81,
51(1)117,
51(3)301,
52(1)59,
52(3)177,
52(3)205,
53(2)295,
53(2)319,
55(2)141,
56(3)321,
57(1)147,
57(2)185,
58(1)69,
62(3)267,
67(1)75
- decidability,
35(1)1,
35(2)191,
35(2)227,
35(2)329,
35(2)337,
36(2)173,
37(2)123,
38(1)117,
39(2)281,
41(1)105,
41(2)247,
44(2)199,
44(2)237,
46(1)83,
47(1)27,
47(1)39,
47(1)71,
47(2)225,
47(3)247,
48(2)257,
48(2)329,
49(1)43,
51(3)255,
52(3)177,
53(2)243,
55(1)1,
55(2)141,
58(1)231,
59(3)287,
61(2)259,
61(2)289,
64(3)305,
64(3)343,
65(2)265,
66(1)55,
67(1)5,
67(1)19,
67(1)129,
67(2)143,
67(2)303,
68(3)267,
68(3)319,
68(3)343
- decide,
66(1)55
- expression,
35(2)313,
36(1)27,
38(2)223,
39(2)155,
40(2)257,
40(2)329,
43(2)213,
43(2)277,
44(1)51,
45(1)1,
46(2)175,
48(1)117,
55(1)1,
56(3)345,
64(1)25
- free, context-,
35(1)1,
35(2)191,
35(2)295,
35(2)313,
36(1)89,
36(1)109,
37(2)217,
37(3)357,
38(1)133,
38(2)323,
39(1)3,
39(1)z,
39(2)89,
40(2)131,
40(2)149,
40(2)315,
41(1)1,
41(1)33,
41(1)105,
41(2)169,
41(2)231,
42(1)1,
44(2)229,
44(3)259,
45(1)87,
46(1)83,
47(1)71,
47(1)95,
47(1)107,
47(2)219,
47(2)225,
47(3)247,
47(3)315,
48(1)101,
48(2)201,
48(2)283,
49(1)23,
49(2)113,
49(2)283,
51(1)81,
51(1)117,
51(3)301,
52(1)59,
52(3)177,
52(3)205,
53(2)295,
53(2)319,
55(2)141,
56(3)321,
57(1)147,
57(2)185,
58(1)69,
62(3)267,
67(1)75
- power,
36(1)1,
36(1)127,
39(2)267,
40(1)13,
41(1)109,
44(1)1,
44(1)111,
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
- rational,
39(2)333,
40(1)13,
43(1)91,
44(1)107,
44(3)259,
46(1)101,
47(1)39,
47(3)247,
47(3)335,
48(2)329,
53(2)187,
57(2)185,
57(2)303,
58(1)81,
58(1)231,
64(1)1,
65(0)123,
65(2)123,
65(2)171,
65(2)213,
65(2)z,
67(1)65,
68(3)253,
68(3)347
- recognizable,
35(2)179,
43(1)91,
47(1)39,
48(2)183,
58(1)201
- series,
40(1)13,
41(1)109,
43(1)91,
44(1)1,
44(2)209,
57(1)147,
67(2)261
- subset,
35(2)179,
36(1)99,
38(1)17,
41(1)121,
43(1)117,
48(2)329,
58(1)201
- unambiguous,
47(1)107,
51(1)215,
52(1)59,
60(3)285
- whether,
66(1)55