Entry Muller:1992:AAW 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{Muller:1992:AAW,
  author =       "D. E. Muller and A. Saoudi and P. E. Schupp",
  title =        "Alternating automata, the weak monadic theory of trees
                 and its complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "97",
  number =       "2",
  pages =        "233--244",
  day =          "27",
  month =        apr,
  year =         "1992",
  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 =   "Illinois Univ., Urbana, IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alternating automaton; automata theory; Buchi
                 acceptance; complexity; computational complexity;
                 formal languages; formal logic; language; prenex normal
                 form; quantifiers; time bound; trees; trees
                 (mathematics); weak acceptance condition; weak monadic
                 logic; weak monadic sentences",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries