Entry Rich:1994:COF from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                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{Rich:1994:COF,
  author =       "Craig A. Rich and Giora Slutzki",
  title =        "The complexity of optimizing finite-state
                 transducers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "129",
  number =       "2",
  pages =        "323--336",
  day =          "04",
  month =        jul,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=129&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=129&issue=2&aid=1493",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4220 (Automata
                 theory); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., California State Polytech.
                 Univ., Pomona, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computation; computational complexity; finite
                 automata; hierarchy; maximizing states; minimizing
                 states; NL complexity class; nondeterministic
                 finite-state transducer; optimal output; optimisation;
                 optimizing finite-state transducers; state
                 alternations; transducers; transition output",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries