Entry Spehner:1988:RFL 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{Spehner:1988:RFL,
author = "Jean-Claude Spehner",
title = "La reconnaissance des facteurs d'un langage fini dans
un texte en temps lin{\'e}aire. ({French}) [{The}
recognition of the factors of a finite language in a
text in linear time]",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "341--381",
month = dec,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ de Haute Alsace",
affiliationaddress = "Mulhouse, Fr",
classification = "721; 723; C4210 (Formal logic); C4220 (Automata
theory)",
corpsource = "Dept. de Math. et Informatique, Fac. des Sci. et
Tech., Univ. de Haute Alsace, Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata theory; Automata Theory; Computer
Programming--Algorithms; Factor Transducers; family of
identifiers; finite language; Finite Languages; formal
languages; Formal Languages; Language Factors; partial
automaton; transducer",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- automaton,
35(1)17,
35(2)313,
36(2)291,
38(1)1,
38(1)133,
39(2)171,
40(1)31,
40(2)149,
40(2)163,
47(1)95,
47(3)335,
48(1)117,
53(2)307,
61(1)17,
63(2)141,
63(2)223,
65(2)123,
66(3)273,
67(1)65
- factor,
41(1)61,
44(1)107,
45(1)63,
48(1)35,
57(2)303,
58(1)3,
58(1)201,
63(3)333,
64(2)175,
66(2)157
- family,
36(2)345,
39(2)239,
39(2)281,
44(1)111,
54(2)165,
55(2)183,
58(1)69,
61(2)175,
63(1)19,
63(2)157,
67(1)111,
68(2)155
- French,
58(1)231,
60(3)255,
65(2)153,
67(1)121
- linear,
35(1)109,
35(2)261,
37(2)123,
38(1)69,
39(1)69,
39(1)z,
40(1)31,
40(1)67,
40(2)195,
40(2)257,
41(2)231,
41(2)325,
43(1)11,
43(2)345,
47(3)237,
47(3)277,
47(3)329,
48(1)35,
49(1)81,
50(1)1,
54(1)65,
54(2)199,
57(2)161,
57(2)317,
58(1)209,
59(0)3,
59(1)157,
59(3)309,
60(3)255,
63(3)275,
64(1)97,
64(2)135,
64(2)159,
65(2)221,
65(2)243,
65(2)z,
67(1)55,
68(3)333
- partial,
36(1)127,
37(3)269,
39(1)47,
39(2)189,
40(1)31,
40(2)323,
43(2)149,
45(1)1,
48(2)229,
53(1)3,
55(1)87,
57(1)3,
59(1)133,
60(1)1,
61(2)199,
62(3)251,
63(1)43,
63(2)113,
63(2)141,
64(1)67,
64(3)281,
65(2)221,
66(3)289,
67(1)19,
67(1)129,
67(2)283,
68(1)37,
68(3)343,
69(2)117
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- recognition,
35(2)271,
39(2)89,
41(2)231,
43(1)31,
43(2)239,
43(2)315,
44(1)111,
47(3)315,
48(2)145,
52(3)177,
57(1)97,
60(3)231,
63(1)1,
63(2)203,
64(1)107,
66(1)99,
68(2)155
- text,
40(1)31,
48(1)35,
63(1)91
- time,
35(2)215,
36(2)203,
36(2)265,
37(1)1,
37(2)123,
38(2)157,
38(2)249,
38(2)269,
38(2)323,
40(1)31,
40(1)57,
40(1)67,
40(2)175,
40(2)195,
41(1)81,
41(2)141,
43(2)337,
46(2)219,
46(2)261,
47(1)39,
47(1)85,
47(3)315,
47(3)329,
48(1)9,
48(1)35,
48(2)273,
49(1)81,
50(2)183,
51(1)177,
51(1)221,
51(1)239,
52(3)177,
52(3)269,
53(2)201,
54(1)53,
54(1)65,
54(1)129,
54(2)181,
54(2)199,
54(2)249,
54(2)315,
56(1)3,
56(2)211,
57(2)317,
57(2)327,
58(1)57,
58(1)69,
58(1)155,
58(1)175,
58(1)249,
58(1)325,
59(1)115,
60(3)255,
61(2)175,
62(1)105,
63(1)43,
63(3)295,
68(1)57,
68(3)319,
69(2)117
- transducer,
42(3)251,
45(1)63,
47(1)71,
64(1)39