Entry Cho:1991:FAA 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{Cho:1991:FAA,
  author =       "Sang Cho and Dung T. Huynh",
  title =        "Finite-automaton aperiodicity is {PSPACE-complete}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "88",
  number =       "1",
  pages =        "99--116",
  day =          "30",
  month =        sep,
  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); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Texas Univ., Richardson, TX, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; dot-depth-one language
                 recognition; exact complexity; finite automata;
                 finite-automaton aperiodicity; formal languages;
                 logspace-complete; NL; nondeterministic
                 logspace-bounded Turing machines; piecewise testable
                 language recognition",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries