Entry Hromkovic:1989:TLR from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Hromkovic:1989:TLR,
  author =       "Juraj Hromkovic",
  title =        "Tradeoffs for language recognition on alternating
                 machines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "63",
  number =       "2",
  pages =        "203--221",
  month =        feb,
  year =         "1989",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comenius Univ",
  affiliationaddress = "Bratislava, Czech",
  classification = "721; 723; C4220 (Automata theory)",
  corpsource =   "Dept. of Theor. Cybernet. and Math. Inf., Comenius
                 Univ., Bratislava, Czechoslovakia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "alternating machine; Alternating Machines; Automata
                 Theory; complexity measure; Complexity Measures;
                 Computational Complexity; Computer Metatheory; Computer
                 Systems, Digital; finite automata; input tape; Language
                 Recognition; nondeterministic machines; optimal lower
                 bounds; parallel computing model; Parallel Random
                 Access Machines; read-only heads",
  pubcountry =   "Netherlands",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

Related entries