Entry Birget:1994:WPI from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Birget:1994:WPI,
author = "Jean-Camille Birget and Stuart W. Margolis and John C.
Meakin",
title = "The word problem for inverse monoids presented by one
idempotent relator",
journal = j-THEOR-COMP-SCI,
volume = "123",
number = "2",
pages = "273--289",
day = "31",
month = jan,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=123&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=123&issue=2&aid=1335",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
Lincoln, NE, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "congruence class; context-free languages;
deterministic context-free language; idempotent
relator; inverse monoids; linear-time algorithm;
parenthesis languages; polynomial-time algorithm;
positively labelled indempotent; word problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Birget, Jean-Camille,
119(2)267,
132(1)243
- congruence,
71(3)281,
75(3)223,
76(2)261,
80(2)227,
96(2)325,
100(2)267,
113(1)119,
114(1)173,
118(2)263,
134(2)537,
136(2)471
- idempotent,
84(2)251,
108(1)151,
124(1)71
- inverse,
76(2)243,
79(1)163,
87(1)1,
95(2)207,
100(2)325,
104(2)161,
110(1)1
- labelled,
73(1)91,
83(1)157,
91(2)285,
102(1)165,
103(2)335,
106(1)61,
108(2)345,
120(1)101,
126(1)3,
126(1)53,
131(1)181,
132(1)1,
134(1)87,
135(2)289
- linear-time,
92(1)77,
92(1)119,
99(2)213,
115(2)351,
120(2)169,
123(1)151,
126(1)77
- monoid,
73(1)81,
73(3)335,
74(1)3,
74(2)121,
76(2)251,
78(2)319,
78(2)347,
81(1)17,
84(2)225,
86(2)233,
91(2)285,
92(1)77,
92(2)249,
92(2)269,
97(2)301,
98(1)5,
98(2)321,
99(2)231,
100(1)67,
104(2)161,
107(1)31,
108(1)103,
108(1)z,
112(2)311,
117(1)91,
117(1)z,
120(1)101,
123(2)239,
125(2)167,
125(2)361,
131(2)271,
134(1)3,
134(1)13,
134(1)87,
134(1)107,
134(1)189,
134(1)209,
134(2)537
- one,
73(3)265,
75(1)3,
96(2)389,
96(2)411,
112(2)187,
118(1)3,
118(1)49,
119(2)331,
123(2)239,
132(1)395,
134(1)51
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
129(1)95,
132(1)179,
134(2)473
- presented,
70(2)251,
131(2)271
- time, linear-,
92(1)77,
92(1)119,
99(2)213,
115(2)351,
120(2)169,
123(1)151,
126(1)77
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
129(1)95,
132(1)179,
134(2)473
- word,
71(3)281,
71(3)381,
72(1)27,
72(1)39,
72(1)55,
73(3)335,
74(1)3,
79(1)195,
79(1)241,
81(1)147,
81(2)305,
82(1)71,
83(2)301,
85(1)33,
86(2)277,
88(1)83,
88(2)365,
92(1)19,
93(2)227,
94(2)199,
94(2)367,
96(2)325,
96(2)405,
99(2)327,
100(1)67,
102(2)253,
106(2)327,
106(2)373,
106(2)395,
108(1)3,
108(1)17,
108(1)45,
108(1)103,
108(1)z,
108(2)251,
108(2)311,
108(2)357,
110(1)1,
112(2)187,
112(2)311,
115(1)43,
115(2)191,
115(2)243,
117(1)217,
119(2)267,
120(2)303,
123(1)55,
126(2)237,
127(1)53,
129(2)263,
129(2)369,
131(2)271,
132(1)129,
132(1)415,
134(1)209,
134(1)225,
134(1)z,
134(2)529,
136(2)361