Entry Yang:1996:MMB from complngs.bib

Last update: Thu Jun 20 02:00:37 MDT 2019                Valid HTML 4.0!

Index sections

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{Yang:1996:MMB,
  author =       "Wuu Yang",
  title =        "{Mealy} machines are a better model of lexical
                 analyzers",
  journal =      j-COMP-LANGS,
  volume =       "22",
  number =       "1",
  pages =        "27--38",
  month =        apr,
  year =         "1996",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Sat Mar 28 20:04:05 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao-Tung Univ",
  affiliationaddress = "Taiwan",
  classcodes =   "C4220 (Automata theory); C4240 (Programming and
                 algorithm theory)",
  classification = "721.1; 723.2; 723.5; 921.6; C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ.,
                 Hsinchu, Taiwan",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "Automata theory; Computer programming languages;
                 Context free syntax; Data reduction; data-parallel
                 lexical analysis; Encoding (symbols); finite; finite
                 automata; finite lookahead automata; Finite lookahead
                 automata; input character; input character
                 partitioning; Lexical analysis; lexical analyzers;
                 longest-match rule; look-ahead problem; lookahead
                 automata; machines; Mathematical models; Mealy
                 machines; Moore; Moore machines; output tokens;
                 parallel algorithms; Parallel algorithms; parallel
                 algorithms; partitioning; Problem solving; program
                 compilers; programming theory; sequential analysis;
                 state transitions; suffix automata; Suffix automata;
                 suffix automata",
  pubcountry =   "UK",
  treatment =    "T Theoretical or Mathematical",
}

Related entries