Entry Weber:1991:DAF 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{Weber:1991:DAF,
  author =       "A. Weber and H. Seidl",
  title =        "On the degree of ambiguity of finite automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "88",
  number =       "2",
  pages =        "325--349",
  day =          "07",
  month =        oct,
  year =         "1991",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Fachbereich Inf., J. W. Goethe Univ.,
                 Frankfurt-am-Main, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "decidability; decidable; degree of ambiguity; finite
                 automata; inner structure; maximal finite degree of
                 ambiguity; polynomial time",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries