Entry Brouwer:1998:MFA from lncs1998a.bib
Last update: Fri Mar 23 02:19:19 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{Brouwer:1998:MFA,
author = "K. Brouwer and W. Gellerich and E. Ploedereder",
title = "Myths and facts about the efficient implementation of
finite automata and lexical analysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1383",
pages = "1--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Oct 10 14:40:24 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1998a.bib",
acknowledgement = ack-nhfb,
}
Related entries
- analysis,
1357(0)270,
1361(0)159,
1362(0)110,
1362(0)110-1,
1362(0)159,
1362(0)217,
1363(0)195,
1364(0)255,
1365(0)313,
1366(0)79,
1366(0)94,
1366(0)163,
1366(0)246,
1366(0)423,
1369(0)413,
1371(0)123,
1371(0)273,
1373(0)1,
1375(0)240,
1376(0)333,
1378(0)48,
1380(0)1,
1381(0)27,
1381(0)75,
1382(0)239,
1382(0)255,
1383(0)80,
1383(0)95,
1383(0)109,
1383(0)306,
1384(0)201,
1384(0)281,
1384(0)358,
1386(0)96,
1388(0)19,
1388(0)61,
1388(0)73,
1388(0)742,
1388(0)756,
1388(0)1015,
1388(0)1025,
1389(0)243,
1389(0)257,
1389(0)347,
1392(0)193,
1394(0)36,
1394(0)96,
1394(0)378,
1396(0)256,
1401(0)747,
1401(0)887,
1403(0)422,
1407(0)202,
1407(0)305,
1407(0)305-1,
1407(0)354,
1408(0)20,
1411(0)238,
1411(0)238-1,
1413(0)219,
1413(0)305,
1415(0)112,
1415(0)321,
1415(0)347,
1418(0)60,
1420(0)26,
1420(0)246,
1420(0)326,
1421(0)3,
1421(0)254,
1423(0)77,
1423(0)412,
1424(0)75,
1424(0)123,
1424(0)316,
1424(0)330,
1424(0)330-1,
1424(0)444,
1424(0)444-1,
1424(0)585,
1427(0)71,
1427(0)268,
1427(0)305,
1429(0)140,
1429(0)214,
1432(0)246,
1434(0)88,
1434(0)205,
1439(0)13,
1442(0)1,
1442(0)52,
1442(0)118,
1444(0)15,
1445(0)601
- automata,
1363(0)157,
1363(0)315,
1373(0)25,
1373(0)116,
1373(0)128,
1373(0)139,
1373(0)320,
1373(0)356,
1373(0)444,
1373(0)555,
1378(0)81,
1380(0)42,
1380(0)88,
1382(0)326,
1384(0)102,
1384(0)263,
1386(0)190,
1386(0)319,
1387(0)248,
1388(0)261,
1388(0)373,
1388(0)584,
1396(0)82,
1398(0)37,
1401(0)963,
1414(0)157,
1416(0)56,
1427(0)268,
1433(0)79,
1433(0)79-1,
1436(0)25,
1436(0)29,
1436(0)87,
1436(0)104,
1436(0)109,
1436(0)171,
1436(0)228,
1436(0)232,
1436(0)241,
1443(0)152,
1443(0)409,
1443(0)470,
1443(0)482,
1443(0)616,
1443(0)628,
1448(0)14,
1450(0)296,
1450(0)665,
1450(0)816,
1450(0)825,
1450(0)834
- efficient,
1357(0)450,
1358(0)1,
1377(0)72,
1377(0)201,
1381(0)90,
1384(0)5,
1384(0)136,
1388(0)183,
1388(0)857,
1391(0)130,
1391(0)130-1,
1394(0)110,
1394(0)144,
1394(0)383,
1396(0)291,
1399(0)211,
1401(0)262,
1401(0)907,
1403(0)406,
1403(0)576,
1405(0)49,
1405(0)64,
1406(0)595,
1406(0)843,
1407(0)382,
1412(0)383,
1416(0)56,
1416(0)535,
1417(0)103,
1421(0)427,
1423(0)323,
1425(0)415,
1427(0)357,
1431(0)195,
1432(0)107,
1432(0)310,
1436(0)7,
1436(0)159,
1436(0)176,
1438(0)320,
1443(0)247,
1443(0)375,
1443(0)387,
1443(0)772,
1443(0)884,
1448(0)80,
1448(0)209,
1449(0)35,
1449(0)105,
1449(0)229
- finite,
1363(0)157,
1373(0)356,
1373(0)533,
1379(0)32,
1384(0)102,
1388(0)373,
1396(0)82,
1398(0)37,
1398(0)208,
1401(0)347,
1401(0)878,
1401(0)887,
1401(0)913,
1401(0)916,
1423(0)226,
1423(0)514,
1424(0)408,
1433(0)13,
1433(0)79,
1433(0)79-1,
1433(0)90,
1436(0)198,
1438(0)391,
1443(0)482,
1443(0)896,
1447(0)345,
1450(0)296,
1450(0)798
- implementation,
1357(0)34,
1357(0)96,
1357(0)141,
1357(0)264,
1357(0)450,
1365(0)31,
1368(0)18,
1368(0)238,
1375(0)138,
1375(0)476,
1376(0)141,
1377(0)311,
1377(0)404,
1377(0)404-1,
1380(0)192,
1385(0)117,
1385(0)117-1,
1388(0)604,
1392(0)21,
1392(0)67,
1397(0)40,
1397(0)313,
1399(0)115,
1399(0)211,
1401(0)105,
1401(0)125,
1401(0)151,
1401(0)193,
1401(0)213,
1401(0)252,
1401(0)907,
1408(0)237,
1412(0)338,
1415(0)68,
1417(0)247,
1418(0)211,
1423(0)64,
1424(0)186,
1424(0)605,
1425(0)326,
1427(0)110,
1430(0)451,
1430(0)509,
1431(0)182,
1431(0)217,
1436(0)56,
1436(0)87,
1436(0)176,
1446(0)9
- lexical,
1398(0)43