Entry Petersen:1996:LPW 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{Petersen:1996:LPW,
author = "H. Petersen",
title = "On the language of primitive words",
journal = j-THEOR-COMP-SCI,
volume = "161",
number = "1--2",
pages = "141--156",
day = "15",
month = jul,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=161&issue=1-2&aid=2039",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4220 (Automata theory); C4240C
(Computational complexity)",
corpsource = "Inst. f{\"u}r Inf., Stuttgart Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic coding theory; Boolean functions;
complexity; computational complexity; constant-depth
polynomial-size unbounded fan-in boolean circuits;
context-free languages; decidability; formal language
theory; Lyndon words; primitive words; primitivity;
pushdown automata; RAM model; shorter word; two-way
deterministic pushdown automata; unambiguous
context-free language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boolean,
134(1)51,
137(1)109,
137(1)159,
137(2)237,
138(2)353,
139(1)187,
141(1)283,
143(2)335,
143(2)343,
145(1)45,
145(1)371,
155(2)411,
156(1)99,
157(2)139,
160(1)1,
160(1)321,
160(1)365,
161(1)301,
163(1)1,
163(1)283,
168(1)39,
171(1)3,
172(1)135,
172(1)233,
172(1)293,
174(1)137,
175(2)257,
175(2)337,
179(1)251,
179(1)427,
180(1)47,
180(1)155,
180(1)243,
182(1)257,
186(1)171,
188(1)117,
188(1)211,
190(2)317,
191(1)79,
197(1)247,
205(1)317,
207(2)329,
217(2)255,
223(1)193,
226(1)207
- circuit,
137(1)109,
137(2)279,
141(1)283,
143(2)335,
148(1)33,
154(1)23,
156(1)99,
157(1)91,
158(1)193,
162(1)133,
163(1)283,
174(1)137,
180(1)325,
182(1)171,
188(1)117,
191(1)97,
191(1)215,
197(1)57,
197(1)171,
209(1)47,
209(1)389
- coding,
148(2)227,
155(1)267,
159(1)103,
163(1)177,
164(1)165,
168(2)267,
175(2)293,
187(1)203
- constant-depth,
191(1)97
- context-free,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)143,
158(1)161,
161(1)23,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
168(2)321,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
197(1)189,
202(1)231,
215(1)349
- decidability,
138(1)3,
139(1)1,
139(1)27,
141(1)253,
145(1)111,
146(1)243,
147(1)149,
147(1)165,
148(2)227,
148(2)281,
150(1)1,
154(1)23,
154(1)107,
155(2)321,
155(2)447,
156(1)119,
157(1)115,
158(1)161,
160(1)145,
160(1)185,
161(1)93,
161(1)191,
164(1)29,
164(1)123,
164(1)141,
164(1)223,
165(2)247,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
168(2)241,
168(2)z,
170(1)1,
170(1)445,
172(1)67,
172(1)309,
174(1)217,
174(1)269,
175(1)15,
175(1)127,
175(1)z,
176(1)67,
176(1)111,
176(1)175,
176(1)235,
179(1)301,
180(1)61,
180(1)203,
183(1)83,
183(2)215,
186(1)231,
193(1)149,
193(1)181,
193(1)197,
194(1)87,
194(1)219,
195(1)33,
195(2)113,
197(1)79,
197(1)245,
198(1)1,
215(1)169,
216(1)363
- depth, constant-,
191(1)97
- deterministic,
138(2)273,
138(2)315,
142(1)59,
143(1)159,
143(2)269,
143(2)285,
145(1)391,
150(1)111,
152(2)219,
154(1)23,
154(2)183,
154(2)225,
156(1)71,
157(2)259,
157(2)273,
158(1)221,
159(1)43,
161(1)301,
163(1)193,
165(2)275,
165(2)355,
165(2)475,
167(1)171,
168(1)39,
168(2)241,
170(1)209,
172(1)135,
178(1)1,
179(1)251,
180(1)181,
180(1)217,
182(1)233,
183(2)281,
185(1)15,
185(1)63,
187(1)105,
190(1)41,
190(1)61,
191(1)37,
191(1)61,
192(1)55,
194(1)57,
194(1)163,
194(1)240-2,
195(1)3,
197(1)95,
198(1)99,
215(1)191,
225(1)1
- free, context-,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)143,
158(1)161,
161(1)23,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
168(2)321,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
197(1)189,
202(1)231,
215(1)349
- Lyndon,
178(1)171,
218(1)41
- Petersen, H.,
141(1)329
- polynomial-size,
137(2)279,
154(1)23,
182(1)183
- primitive,
152(1)1,
154(2)247,
155(1)39,
155(1)179,
157(2)273,
163(1)269,
164(1)29,
176(1)111,
187(1)3,
191(1)145,
192(2)167,
193(1)129
- primitivity,
164(1)29
- pushdown,
165(2)275,
180(1)341,
181(1)141,
195(2)113,
207(1)117,
215(1)239
- shorter,
216(1)395
- size, polynomial-,
137(2)279,
154(1)23,
182(1)183
- two-way,
169(2)161
- unambiguous,
194(1)137
- unbounded,
138(2)273,
174(1)217,
179(1)217
- way, two-,
169(2)161
- word,
146(1)321,
154(1)67,
154(2)387,
155(2)291,
155(2)349,
155(2)425,
156(1)119,
156(1)281,
158(1)35,
159(1)15,
159(1)43,
160(1)87,
162(1)79,
163(1)1,
163(1)291,
163(1)309,
164(1)29,
164(1)165,
164(1)277,
165(2)295,
170(1)407,
172(1)67,
172(1)273,
174(1)1,
174(1)171,
178(1)129,
178(1)171,
178(1)205,
180(1)81,
180(1)341,
183(1)45,
183(1)83,
197(1)1,
197(1)57,
197(1)235,
198(1)1,
200(1)205,
204(1)87,
218(1)13,
218(1)41,
218(1)83,
218(1)95,
218(1)123,
218(1)135,
218(1)161,
223(1)73,
224(1)215,
225(1)129,
225(1)149