Entry Weber:1994:EUL 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:1994:EUL,
  author =       "Andreas Weber",
  title =        "Exponential upper and lower bounds for the order of a
                 regular language",
  journal =      j-THEOR-COMP-SCI,
  volume =       "134",
  number =       "1",
  pages =        "253--262",
  day =          "07",
  month =        nov,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:31 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=1;
                 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=134&issue=1&aid=1650",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  conflocation = "Kyoto, Japan; 25-28 Aug. 1992",
  conftitle =    "Second International Colloquium on Words, Languages
                 and Combinatorics",
  corpsource =   "Fachbereich Inf., Frankfurt Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "deterministic finite automaton; exponential lower
                 bounds; exponential upper bounds; finite automata;
                 formal languages; nondeterministic finite automaton;
                 regular language order",
  pubcountry =   "Netherlands",
  sponsororg =   "Kyoto Sangyo Univ",
  treatment =    "T Theoretical or Mathematical",
}

Related entries