Counting as Method , Model and Task in Theoretical Computer Science

@inproceedings{Reinhardt2005CountingAM,
  title={Counting as Method , Model and Task in Theoretical Computer Science},
  author={Klaus Reinhardt},
  year={2005}
}
family of languages, 59 AC, 80 AC, 21 ACC, 80 advice, 17, 26 AFL, 59 alternation, 19 automaton finite, 83 Auxiliary Pushdown Automaton, 18 AuxPDA, 18 BDD, 53 Binary Decision Diagrams, 53 BLIND, 64 bounded, 70 bounded fan-in, 21 Branching Programs, 53 carrier set, 119 ccc, 73 cdc, 74 certificate, 31 CFLth, 64, 67 characteristic function, 15 clow sequence, 42 complement, 88 complexity class, 13 Concurrent, 22 congruence, 60 connectedness, 102 connectivity problem, 14 context-free complement… CONTINUE READING

Similar Papers

Loading similar papers…