A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
Tree automata work on finite or infinite trees. They generalize word automata (Finite, Buchi, Rabin, Streett, Muller, etc.).
Questions about a special kind of graphs, namely connected and cycle-free ones.
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
verifying that a variable, expression or value has the declared type
Questions about problems which cannot be solved by any Turing machine.
Questions about the abstract data structure Union-Find (also called disjoint-set) and its realizations.
The VC dimension (for Vapnik–Chervonenkis dimension) is a measure of the capacity (complexity, expressive power, richness, or flexibility) of a statistical classification algorithm, defined as the car…
Questions about techniques for providing the appearance of an isolated, contiguous address space to each process. The size of the address spaces may be made to appear larger than the size of main mem…
Questions about graphs in which every edge is associated with a weight.
Questions about combinatorics on languages of words, that is how many sequences of symbols with certain properties there are.
a formal language for modelling computer systems.