(0, 0)-GCM (0, 1)-assignment (0, 1)-matrices 0L array systems 0L language 0L languages 0L system 0L systems 0S derivation relations 0-1 law 0-1 law for algorithmically random sequences 0-1 law under the uniform probability distribution 0-1 laws 0-1 laws by preservation 0-1 laws for fragments of L&infin:ω 0-1 sequences 0-term 1ACM(k) 1S grammar 1S grammars 1-bounded 1-bounded compact ultrametric spaces 1-bounded nets 1-bounded Petri nets 1-cheatable set 1-dimensional RCA 1-DPDA 1-graphs 1-inkdot alternating Turing machines 1-letter terminal alphabeth 1-level restricted 1-NCE graph grammars 1-output slices 1-parity reduction 1-pebble cyclic automata 1-reducible substitution graph 1-retreat-bounded regular picture language 1-safe 1-safe finite Petri nets 1-safe free-choice nets 1-safe nets 1-safe Petri nets 1-solvable tasks 1-tape 1-tape alternating Turing machine 1-tape and 2-tape Turing machines 1-tape ATM's 1-tape Turing machine 1-tape Turing machines 1-truth-table-hard languages 1-Turing reductions 1-turn deterministic pushdown automaton 1-writer m-reader atomic register 1-writer m-reader atomic registers 2 letter alphabet 2 multiple context-free grammars 2λ-calculus 2DFA 2DPDA (2-way deterministic pushdown automaton) 2DST 2DST mappings 2DST mappings on languages 2-adjacent context-free languages 2-AFA 2-alternation bounded ATM 2-asynchronous automata 2-automatic sequence 2-bounded languages 2-categories 2-category 2-cheatable sets 2-clauses 2-colored on-line algorithm 2-coloring 2-coloring hypergraphs 2-colourability of hypergraphs 2-competitive 2-connected 2-connected graph 2-connected graphs 2-connected outerplanar graph 2-context-free languages 2-D alternating finite automata 2-D online tesselation acceptors 2-dimensional 2-dimensional cellular automaton 2-dimensional compatibility of parameter passing and implementations 2-dimensional consecutive sets problem 2-dimensional matching 2-dimensional VASS's 2-dimensional vector addition systems 2-dota 2-edge-connected component 2-functor 2-head finite automata 2-heads 2-label space 2-labelling 2-machine flow-shop problems 2-machine open-shop problems 2-MCFG 2-nd order unification problem 2-NOTA 2-output Boolean networks 2-output combinational networks 2-paperfolding sequence 2-partition 2-pebble automata 2-person domino game 2-rate environments 2-retreat-bounded regular picture languages 2-separated eNCE grammars 2-separated eNCE graph language 2-sorted first order logic 2-structure, labeled ~ 2-structures 2-structures, 2-tape finite automata 2-tape Turing 2-tape Turing machine models 2-tape Turing machines 2-valued 2-valued completeness 2-valued completeness result 2-valued completeness theorem 2-valued consequences 2-valued distance automaton 2-valued logical consequences 2-way deterministic pushdown automata 3 letter alphabet 3D discrete Jordan theorem 3D Jordan property 3D translational motion planning 3D triangular meshes 3-alternation bounded ATM 3-bounded orientation 3-chromatic number 3-colorability 3-colourability 3-competitive 3-competiveness of HARMONIC 3-connected planar graphs 3-connected plane graphs 3-D polyhedral world 3-dimension matching 3-dimensional associative algebras 3-dimensional matching 3-edge colouring pairs of trees problem 3-exact cover 3-infix-outfix 3-infix-outfix code 3-infix-outfix maximal codes 3-pebble automata 3-rate environments 3-regular graph 3-SAT 3-SAT problems 3-satisfiability 3-separated eNCE graph language 3-stage Clos network 3-valued 3-valued completeness result 3-valued completeness theorem 3-valued declarative semantics of Ku¨nen for normal programs 3-valued logic 3-valued logical consequences 4-connected plane graphs 4-connectivity 5NF definition for relational database design 5-bounded acyclic orientation 5-competitive algorithm 5-dimensional vector addition systems 6-bounded acyclic orientation 72 degrees of freedom E´sik Aa¨t-Kaci et al. A2CCS Aanderaa Aanderaa and Rosenberg conjecture Aanderaa-Rosenberg conjecture Abadi Abadi Abadi and Abadi and Lamport Abadi and Manna abbreviated CSS abduction abduction abduction from logic programs abduction model abduction model for logic programming abduction problem abductive abductive abductive hypothesis abductive inference engine abductive logic abductive logic program abductive logic programs abductive reasoning abductive residual hypotheses abductive solutions ABE Abelian Abelian abelian Abelian black-box groups Abelian group Abelian group of actions Abelian group of temporal displacements Abelian groups Abelian groups admitting a universal presentation Abelian lattice-ordered groups Abelian l-groups Abelian monoids Abelian permutation groups Abelian square Abelian squares in a string Abelson Abelson model of distributed computation ABE-problem Abiteboul Abiteboul and Vianu Abiteboul et al. Abiteboul/Vianu's transaction schemas abnormality abnormality of behaviour Abrahamson Abrahamson Abrahamson et al. Abramsky Abramsky's category SProc Abramsky's partial bisimulation Abramsky's proof-as-processes paradigm absence absence of absence of function symbols absence of miracles absence of negation absence of partial deadlocks absence of termination absence of the fixed point properties absolute absolute logics absolute logics of programs absolute program-size complexity absolute representation theorems absolutely free algebras absolutely noncircular attribute grammars absolutely parallel grammars absoluteness absoluteness absorbing absorbing absorbing process absorbing rule absorbing scheme abstract abstract abstract algebra abstract algebraic institutions abstract algebraic software specification abstract automata abstract backward propagation abstract basis abstract characterization theorem abstract common patterns abstract commutation abstract complexity theory abstract compositional abstract compositional equivalence relations abstract compositional semantics abstract compression abstract compression schemes abstract computation path semantics abstract computations as arrows abstract control languages abstract data structures abstract data type abstract data type for defining semantics abstract data type specifications abstract data type system abstract data type systems abstract data types abstract decorations abstract definition abstract design abstract deterministic automata abstract domains abstract dynamic-data types abstract equivalence abstract fairness abstract families abstract families of abstract families of languages abstract families of power series abstract family of languages abstract filter domain abstract flowchart schemes abstract formalism for program terms abstract formalism for program testing abstract formulation abstract forward propagation abstract framework abstract functional dependency structures abstract Go¨del-number abstract geometric automaton abstract grammars abstract grammatical model abstract implementation of logic programming abstract implementations abstract independence structures abstract interpretation abstract interpretation framework abstract language abstract language design abstract languages to define behaviour abstract level abstract machine abstract machines abstract model abstract model of nonsequential systems abstract models abstract models of computation abstract narrower abstract non-algorithmic specifications abstract objects abstract predicates abstract program size complexity abstract programs abstract recursion theory abstract reduction systems abstract relation algebra abstract relational algebra abstract representation abstract resources abstract result abstract rewriting machine abstract search spaces abstract semantic abstract semantic function abstract semantics abstract semiring abstract sheaf theory abstract specification abstract substitution abstract syntax abstract theories abstract theory of data compression abstract treatment of partial correctness logic abstract types abstract types adapted to deterministic algorithmic languages abstract types for programming languages abstract unification abstract unification of elements abstract views abstracting abstracting parts of theories abstraction abstraction abstraction function abstraction homomorphisms abstraction mechanism abstraction mechanisms abstraction of abstraction of a semantic model abstraction of the semantics of an underlying programming language abstraction operation abstraction problems in combinatory logic abstraction rule abstraction rule CFARb abstraction technique abstraction terms abstraction theorem abstractions abstractions abstractive abstractive power of the categorical framework abstractness AC/E systems AC0 AC0 depth AC0 depth-t hierarchy AC0 functions AC0-circuits ACC ACC functions ACC0 class of languages acceleration acceleration of matrix multiplication acceptability acceptability by automata acceptability in program testing acceptability of languages acceptable in exponential time acceptance acceptance by 1ACM(k)'s acceptance by 2-D alternating finite automata acceptance by 2-pebble automata acceptance by a supernonsingular DPDA acceptance by ATM's acceptance by deterministic acceptance by deterministic checking stack automata acceptance by deterministic machines acceptance by finite automata acceptance by multi-pebble automata acceptance by NFA's acceptance by PDA acceptance by pushdown automata acceptance by scanners acceptance by space bounded alternating on-line Turing machines acceptance by STBA's acceptance by systolic acceptance by systolic automata acceptance by systolic tree automata acceptance by the duals of automata acceptance by tree automata acceptance condition acceptance condition of automata acceptance conditions acceptance conditions for control automata acceptance of ω-languages acceptance of ω-languages by deterministic finite automata acceptance of a language by its minimal automaton acceptance of infinite acceptance of infinite trees acceptance of infinite words acceptance of languages acceptance of r.e. sets acceptance of sets of infinite trees acceptance power acceptance power of regular languages acceptance properties of Boolean automata acceptance types acceptation of non-LR(k) grammars accepted ω-languages accepted by Bu¨chi automata accepted by deterministic linear bounded automata accepted by space bounded alternating Turing machines accepted object-oriented data model accepted string accepting computation accepting computations accepting conditions accepting conditions for automata accepting paths accepting power of simple one-way multihead automata accepting powers accepting powers of nondeterministic one inkdot TM's accepting powers of space bounded 2-ATM's accepting powers of SPMHFA's accepting states acceptional power acceptor acceptors acceptors access access probabilities access quorums access structure access time access time for information retrieval access to access to a database access to distributed data structures accessibility accessible mathematical world accessible prefix transition graphs accessible storage accessible term accessing records in a linked list accessing unambiguous computation accidental accidental state transitions accumulations accumulative accumulative divergence accumulators accumulators accuracy accuracy accuracy of computation ACFG acid acids Ackerman Ackermann Ackermann function Ackermann's ACM aconjunctive aconjunctive deterministic normal form for formulae ACP ACP ACP algebra of communicating processes ACP axiom system ACP with abstraction ACP with handshaking communication ACP with silent actions ACPτ ACPτ axiom system ACPτ axioms ACSR ACT ACT action action action alphabets action monoid action monoids action of action of a Cartan subalgebra action of commutativity action of commutativity and approximation action refinements action semantics action semantics expressions action semantics notation actions actions activation activation records active records activities actor actor actor grammars actor systems acyclic acyclic acyclic database schemes acyclic database schemes in relational database theory acyclic deterministic acyclic deterministic automata acyclic deterministic pure grammars acyclic digraph acyclic digraphs acyclic directed graphs acyclic grafts acyclic graphs acyclic hypergraphs acyclic join dependencies acyclic logic programs acyclic network acyclic part of a graph acyclic programs acyclic scheme acyclic submodular functions acyclic views in a database scheme acyclicity acyclicity Aczel Aczel Aczel's anti-foundation axiom Aczel's semantics for SCCS AC-compatible ordering AC-hierarchy AC-RPO ordering AC-symbols AC-unification Ada´mek, Nelson and Reiterman Adámek adaptation adapted adaptive adaptive adaptive adversary scheduler adaptive bounded query machines adaptive comparison searching adaptive information adaptive machine adaptive reducibility ADD operation add operation added features adder adder adding adding arcs adding nondeterminism to parallel machines adding places adding two n-bit numbers addition addition addition chains addition class addition classes addition data flow addition of addition of integers addition of machine real numbers addition of positive independent random variables addition of real numbers additional information additions addition-subtraction chains additive additive additive cellular automata additive complexity additive complexity in directed computations additive complexity of additive complexity of algebraic circuits additive complexity of polynomials additive computation additive constant overhead additive cost in task-trees additive disjunction additive one-dimensional cellular automata additive real machine additive real machines additive scales additively additively cancellative address language address languages address space addresses adequacy adequacy of adequacy of models adequacy of path programs adequacy problem adequacy properties adequacy properties of path programs adequacy-preserving insertion adequacy-preserving transformations adherence adherence equivalence adherence equivalence of D0L languages adherence equivalence problem adherence of adherence of a language adherence of an algebraic language adherence of array languages adherence of D0L adherence of D0L languages adherence of D0L systems adherence of the control set of an array system adherences adherences adherences of languages adic adic system ADJ adjacency adjacency matrices adjacency matrix adjacency matrix of a planar graph adjacency matrix representation adjacency property adjacent adjacent blocks adjacent derivations adjacent processors adjacent vertex adjacent vertices adjoining adjoining an abstract equivalence adjoining optimal realizations adjoint adjoint functors adjoint pair between preorders adjoints adjoints for the inclusion functor adjunction adjunction between frames and topological spaces adjunction of adjunction of functors adjunction of semifunctors adjunctions adjunctions ADJ-group Adleman Adleman and Manders Adler Adler administrative incompleteness admissable heuristic admissibility criterion admissible admissible heuristic admissible heuristic search admissible mappings admissible representations admissible representations of effective cpo's admissible representations of metric spaces admissible sequences ADTS ADTS adult adult languages advantages of probabilistic strategies advantages of probabilistic strategies over deterministic ones adversaries adversaries adversary advice class P/quadratic advice classes advice strings AF AF's AFA AFA AFA's AFA's on trees affine affine affine automata affine monoid affine regular sets affine transformations affinity AFL AFL AFL agreable family of languages AFL operations AFL's AFL's AFL-operations AFP AFP1 AG AG agent agent agent's agent's performance agents agents agents in agents in CCE agents in CCS agent-oriented artificial intelligence agent-passing calculi agent-passing mobility aggregate aggregate aggregate functions aggregate operations aggregate operators aggregate product operator aggregate queries aggregate sum operator aggregate update aggregates aggregates aggregating aggregating teams aggregating teams of learning machines aggregation aggregation aggregation constraints aggregation operators aggregation range constraints aggregation ratios aggregative aggregative closure aggregative closure operator aggregative closure problem aggregative closure query agreable agreable family of languages agreeing pair of morphisms agreements Aho Aho Aho and Corasick Aho et al. Aho, Hopcroft and Ullman Aho, Sagiv and Ullman Aho, Ullman and Yanakakis Aho-Corasick AIP AIP airline Ajtai Ajtai and Fagin AKL AKL Akl Akl et al. Alagar Alagar Alder Alder Aleluinas Aleluinas et al. Alessi Alessi et al. Alexander Alexander method Alexander-ideal ALEXANDRE ALEXANDRE strategy Alexandroff Alexandroff topology Alferes Alferes et al. ALG algebra algebra algebra elements algebra for data structure algebra methods algebra objects algebra of algebra of communicating processes algebra of communicating processes with algebra of communicating processes with abstraction algebra of communicating processes with silent actions algebra of communicating processes with silent steps algebra of concurrent nondeterministic processes algebra of denotations algebra of finite processes algebra of flowcharts algebra of formal algebra of formal languages algebra of formal matrices algebra of functions algebra of generic matrices algebra of infinite trees algebra of Lindenbaum and Tarski algebra of logic programs algebra of meanings algebra of mixed computation algebra of multitree synchronization algebra of multitrees algebra of net expressions algebra of observable equivalence classes algebra of one letter rational expressions algebra of one-letter rational expressions algebra of operations algebra of Petri net concatenable processes algebra of process synchronization algebra of programs algebra of rational trees algebra of regular trees algebra of relations algebra of syntax algebra of the symmetric group algebra of types algebra semantics algebra semantics of algebraic specifications algebra systems algebra with trace algebraic algebraic algebraic abstract data type algebraic abstract data type for defining semantics algebraic abstract data types algebraic abstract types algebraic analogon to domain equations algebraic and algorithmic method for analysing transition systems algebraic approach algebraic approximation algebraic automata theory algebraic axiomatisation algebraic axioms algebraic axioms from samples algebraic based environment algebraic calculi algebraic cell decomposition algebraic characteristics algebraic characterization algebraic characterization of algebraic characterization of behavioral reduction algebraic characterization of frontier testable tree languages algebraic characterization of inference bases algebraic characterization of observational equivalence algebraic characterization of the double-pushout transformation algebraic characterizations algebraic characterizations of complexity classes algebraic characterizations of families of ωZZZsets algebraic characterizations of flowchart schemes algebraic characterizations of monoids algebraic characterizations of transductions algebraic circuits algebraic closure of the ground field algebraic closure operations algebraic coding algebraic compiler algebraic compiler construction algebraic compiler generator algebraic complete partial order algebraic completion algebraic complexity algebraic complexity of rational iteration algebraic complexity theory algebraic computation algebraic computation language algebraic computation tree algebraic computation trees algebraic construction algebraic construction of algebraic construction of compilers algebraic construction of conventional compilers algebraic construction of the syntactic monoid algebraic constructions algebraic cpo algebraic cpo's algebraic criterion algebraic curves algebraic data types algebraic dcpo algebraic decision trees algebraic definition of control structures algebraic denotational semantics algebraic dependencies algebraic dependencies of Yannakakis and Papadimitriou algebraic description of fix algebraic differential equations algebraic domain algebraic domain equations algebraic domains algebraic elimination process algebraic equation algebraic equations algebraic expressions algebraic extension algebraic extension fields algebraic extension of degree n algebraic extension of the λν-calculus algebraic forests algebraic formal power series algebraic formalism algebraic fragment algebraic framework algebraic function algebraic function space algebraic functions algebraic generalized zeta functions algebraic generators algebraic geometric degree algebraic geometry algebraic grammar algebraic grammars algebraic graph algebraic graph grammars algebraic graph rewriting algebraic ground domains algebraic identity algebraic implementation algebraic implementation proofs algebraic implementations algebraic implementations of abstract data types algebraic independence algebraic infinite trees algebraic institutions algebraic interpretation of the λβ k-calculus algebraic language algebraic language theory algebraic languages algebraic languages theory algebraic lattices algebraic laws algebraic L-domains algebraic manipulations algebraic manipulator algebraic mechanisms for language processing algebraic model algebraic model for equivalence of programs algebraic model of software algebraic models algebraic module specifications algebraic modules algebraic number fields algebraic numbers algebraic operators algebraic optimization algebraic optimization framework algebraic optimizaton algebraic partial orders algebraic posets algebraic power series algebraic power series in non-commuting variables algebraic principle algebraic problems algebraic processing algebraic programming algebraic programming language algebraic programming system algebraic proofs algebraic proofs of consistency algebraic proofs of consistency and completeness algebraic properties algebraic properties for separating Chomsky classes algebraic properties of algebraic properties of data types algebraic properties of derivations algebraic properties of infinite trees algebraic properties of structured flowchart schemes algebraic properties of the syntactic monoid algebraic protocols algebraic query languages algebraic relations algebraic rewriting algebraic rewriting systems algebraic semantics algebraic semantics of algebraic semantics of infinitary theories algebraic semantics of specifications algebraic sequences algebraic series algebraic set theory algebraic sets of infinite trees algebraic setting algebraic setting for parallelism algebraic setting for synchronization algebraic signatures algebraic simplification algebraic simplification in computer algebra algebraic software specification algebraic solutions algebraic specifiability of data types algebraic specification algebraic specification formalisms algebraic specification languages algebraic specification of documents algebraic specifications algebraic specifications of algebraic specifications of abstract data types algebraic specifications of concurrent systems algebraic specifications with initial algebra semantics algebraic strategies for Wythoff games algebraic strong normalization algebraic structure algebraic structure for describing hypergraphs algebraic structure of combinatorial problems algebraic structure of transitions algebraic structures algebraic structures for algebraic structures for semantics algebraic structures for transitive closure algebraic structures of boxes algebraic subset algebraic substitution algebraic surfaces algebraic system algebraic systems algebraic technique algebraic term rewriting systems algebraic terms algebraic theories algebraic theories as program specifications algebraic theories of graph grammars algebraic theory algebraic theory of algebraic theory of e´sik algebraic theory of fair algebraic theory of fair asynchronous communicating processes algebraic theory of fair bisimilarity algebraic theory of graph grammars algebraic theory of languages algebraic theory of processes algebraic theory of translation algebraic theory with iterate algebraic tools algebraic topology algebraic transformation algebraic transformation of partial many-sorted unary algebras algebraic translation methods algebraic translations algebraic treatment algebraic types algebraic varieties algebraical algebraical operations for i.s.r. systems algebraically algebraically algebraically closed algebraically closed field algebraically closed fields algebraically closed ground fields algebraically complete categories algebraically complete polynomials algebraically definable functions algebraically defined compilers algebraically specifiable algebraically specified language algebraically structuring algebraically structuring a compiler algebraically structuring the semantic definition of a language algebraicity algebraicity of bi-infinite word languages algebraicly algebraicly complete polynomials algebraize algebraize algebras algebras algebras of binary relations algebras of finite and infinite trees algebras of flowcharts algebras of formal languages algebras of meanings algebras of net expressions algebras of observable equivalence classes algebras of polynomials algebras of process terms algebras of reals algebras of sets of trees algebras of types algebras without rank algebra-based action semantics ALGOL Algol Algol 60-like languages Algol/Pascal family of languages Algol-like language algorithm algorithm algorithm for algorithm for a dynamic problem algorithm for additive complexity algorithm for composition of power series algorithm for constructing DFA's algorithm for counting degree-constrained graphs algorithm for detection of repetitions algorithm for distributed sorting on a systolic ring algorithm for divisibility algorithm for equivalence of algorithm for equivalence of automata algorithm for equivalence of deterministic push-down automata algorithm for equivalence of pushdown tranducers algorithm for factors of a word algorithm for finding algorithm for finding all factors of a language in a text algorithm for finding patterns algorithm for finite subsystems of equations over an alphabeth algorithm for floating point addition algorithm for GAP algorithm for GCD's in rings of integers algorithm for generating shift-register cycles algorithm for Greibach normal form algorithm for information sharing algorithm for leader-election algorithm for membership for picture languages algorithm for minimal algorithm for minimal factor transducers algorithm for minimal nontrivial congruences algorithm for permuting sysmbols algorithm for random generation of polynominoes algorithm for recognizability algorithm for regular set-covering problems algorithm for repetitions in words algorithm for SAT algorithm for set intersection algorithm for shuffles algorithm for SLS representation algorithm for smallest DFA's algorithm for string covers algorithm for st-numbering algorithm for testing Church-Rosser algorithm for testing partial confluence algorithm for the decomposition of semisimple Lie algebras algorithm for the directed subgraph homeomorphism probelm algorithm for the forcing domain of a Boolean network algorithm for the general packet routing problem algorithm for the many function coarsest partition problem algorithm for the multiplication of polynomials over finite fields algorithm for the number of solutions of the σ+-game algorithm for transforming specifications algorithm for transitive closure on acyclic digraphs algorithm for updating minimum spanning trees algorithm of algorithm of Contejean and Devie algorithm of Culik and Harju algorithm of Fortenbacher algorithm of Gabow and Tarjan algorithm of Lipton et al. algorithm of Plaisted and Kapur et al. algorithm of reduction to a canonical form algorithm of Sardinas algorithm on posets algorithm performance on heterogeneous networks algorithm varieties algorithmic algorithmic algorithmic (e.g. combinatorial) problems algorithmic characterization of interior and exterior points algorithmic classes algorithmic complexity algorithmic complexity theory algorithmic content of proofs algorithmic design considerations algorithmic formulae algorithmic graph embeddings algorithmic information theory algorithmic language learning theory algorithmic languages algorithmic logic algorithmic logic for while-programs with nondeterministic assignments algorithmic probability algorithmic problems algorithmic problems in free groups algorithmic problems on graphs algorithmic skeletons algorithmic theories, first-order approximation of ~ algorithmic theory algorithmical algorithmical decidability algorithmically algorithmically constructible context-sensitive language algorithmically random algorithmically random oracle algorithmically random sequences algorithms algorithms algorithms algorithms approximation algorithms algorithms average case analysis of algorithms algorithms controlling concurrent access to a database algorithms detecting degenerate behaviour of differential equations algorithms for algorithms for a dynamic problems algorithms for Abelian permutation groups algorithms for algebraic manipulations algorithms for alignment algorithms for alphabetic trees algorithms for approximate congruence algorithms for approximate location algorithms for arrangements algorithms for associative algebras algorithms for automata automorphism groups algorithms for binary search trees algorithms for bracket abstraction algorithms for butterfly dag computation algorithms for calculating in algebraic extension fields algorithms for canonical forms of circular strings algorithms for changing Gro¨bner bases algorithms for characteristic sets algorithms for checking in the modal nu-calculus algorithms for Church-Rosser algorithms for communication on graphs algorithms for comparison of sequences algorithms for computing minimal types algorithms for computing repetitions algorithms for comunication protocols algorithms for consistency algorithms for constant propagation algorithms for continued fractions algorithms for cube dag computation algorithms for cycle detection algorithms for D0L algorithms for D0L system equivalence algorithms for D0L systems algorithms for data compression algorithms for dataflow analysis algorithms for deadlock detection algorithms for deciding algorithms for deciding equivalence algorithms for deciding functional equivalence algorithms for deciding whether a monoid is a group algorithms for decision problems algorithms for decoding algorithms for Delaunay diagrams algorithms for dense matrix multiplication algorithms for detecting beta-cycles algorithms for differential bases algorithms for digital search trees algorithms for Diophantine equations algorithms for distinguishing bit-strings algorithms for distributed sorting algorithms for DNA sequences algorithms for DTML algorithms for dynamic programming algorithms for edge algorithms for edge colouring algorithms for edge edge labelling algorithms for enforcing relational cosistency algorithms for enumerating reliable axioms algorithms for equivalence algorithms for equivalence problems algorithms for evaluation of graph-like expressions algorithms for extremal paths algorithms for E-unification algorithms for factorization of polynomials algorithms for Fibonacci numbers algorithms for finding algorithms for finding a leader algorithms for finding Fibonacci numbers algorithms for forest matching algorithms for form equivalence algorithms for generalized satisfiability problems algorithms for generating algorithms for generating codes algorithms for generating concepts algorithms for generating finite-state automata algorithms for generating graphs algorithms for generating large primes algorithms for generating ordered trees algorithms for generating trees algorithms for graph algorithms for graph colouring algorithms for graph display algorithms for graph embeddings algorithms for graph partioning algorithms for Hamiltonian cycles algorithms for Hermite canonical form algorithms for heuristic search algorithms for identification of programs algorithms for inclusion algorithms for inclusion of tree transformation classes algorithms for inclusion star height algorithms for inference algorithms for inference bases algorithms for insertion and deletion in skip lists algorithms for integer multiplication algorithms for interactive models algorithms for intersection of halfspaces algorithms for intersections in free groups algorithms for knapsack problems algorithms for language manipulation algorithms for largest trees in graphs algorithms for lattice basis reduction algorithms for LCS algorithms for leader election algorithms for learning algorithms for Lie algebras algorithms for linear Diophantine systems of (in)equations algorithms for Liouvillan solutions algorithms for logic resolution algorithms for matching algorithms for matrix algorithms for matrix computations algorithms for matrix multiplication algorithms for maximal algorithms for maximal codes algorithms for maximal flow algorithms for maximal network flow algorithms for maximum matching algorithms for membership for algorithms for membership for FD's algorithms for membership for MVD's algorithms for membership-inclusion testing algorithms for merging algorithms for metrical task systems algorithms for minimal nontrivial congruences algorithms for minimization of algorithms for minimization of deterministic automata algorithms for minimization of sequential transducers algorithms for minimum algorithms for minimum cut algorithms for minimum length tree layout algorithms for misčre play algorithms for modal resolution algorithms for modes of multisets algorithms for mutual exclusion algorithms for necklace tours algorithms for normal hulls in free groups algorithms for optimal algorithms for optimal alphabetic trees algorithms for optimal placement of resources algorithms for optimum search trees algorithms for orders algorithms for parallelizing database transactions algorithms for parsing algorithms for partial recursive functions algorithms for pattern matching modulo transformations algorithms for permutation routing algorithms for permuting the symbols of an input string algorithms for planar algorithms for planar layouts algorithms for planar region location algorithms for plane representations algorithms for polynomials and matrices algorithms for priority queues algorithms for products in algebras algorithms for products of polynomials algorithms for products of polynomials modulo a polynomial algorithms for program synthesis algorithms for pseudo-linear algebra algorithms for query answering algorithms for querying databases algorithms for random generation algorithms for rational approximation algorithms for reachability algorithms for reachability and connectivity algorithms for reachability graphs algorithms for reactive systems algorithms for realization of dynamical systems algorithms for recognition algorithms for recognition of orders algorithms for recognition problems algorithms for recognizing transductions algorithms for reduced lattice bases algorithms for relative inclusion star height algorithms for representation of graphs in the plane algorithms for representing orders algorithms for routing algorithms for routing on algorithms for routing on graphs algorithms for routing on trees algorithms for satsifiability algorithms for scheduling algorithms for search games algorithms for searching algorithms for segmentation algorithms for selection algorithms for semigroups of matrices algorithms for semi-unification algorithms for sensitivity analysis algorithms for separators in a graph algorithms for sequence comparison algorithms for shift equivalence of polynomials algorithms for shortest common superstring algorithms for singualrity of deterministic pushdown automata algorithms for solving algebraic equations algorithms for sorting algorithms for spanning trees algorithms for sparse polynomials algorithms for speech recognition algorithms for Sprague-Grundy functions algorithms for squares in a string algorithms for string algorithms for string matching algorithms for string searching algorithms for string-matching algorithms for st-numbering algorithms for subdirect decomposition algorithms for subgraph isomorphism algorithms for subtyping and typechecking algorithms for task-trees algorithms for term matching algorithms for testing whether a groupoid is a group algorithms for the algorithms for the BRC property algorithms for the closure of a matrix algorithms for the counterfeit coin problem algorithms for the decomposition of polynomials algorithms for the discrete Fourier transform algorithms for the equivalence algorithms for the equivalence probelm of attribute systems algorithms for the equivalence problem of attribute systems algorithms for the full matrix equivalence probelm algorithms for the implication problem algorithms for the intersection of polyhedra algorithms for the K-selection problem algorithms for the minimum weighted dominating clique problem algorithms for the order of regular events algorithms for the segmentation of images algorithms for the shortest superstring problem algorithms for the synthesis problem algorithms for the zeros of recurrent sequences algorithms for trace languages algorithms for transforming algorithms for transforming programs algorithms for transforming sparse matrices algorithms for transversals algorithms for tree node enumeration algorithms for trees algorithms for type inference algorithms for unification algorithms for updating algorithms for varying data structures algorithms for Voronoi diagrams algorithms for weighted matching algorithms for word algorithms for word functions algorithms for word problems algorithms from proofs algorithms implementations for algorithms in differential algebra algorithms in search games algorithms of algorithms of generation algorithms of Lehmann and Rabin algorithms of structural synthesis algorithms on strings and arrays algorithms on trees algorithms to factorize polynomials algorithms to partition algorithms vs. circuits algoritms for finding transversals alignment alignment of sequences alignment of trees alignment problem alignments all bidirectional edges-problem all pairs all pairs reachability all pairs shortest paths &all;∃-theory of Rp−T Allen Allender Allender Allender and Strauss allocation allocation allocation of allocation of arguments allocation of jobs allocation problems under allocation problems under minmax allocation problems under minsum allocation schemes allocation steps Allouche Allouche et al. allowable forms allowable forms of proofs allowable sets of computation paths allowed database allowed formula allowed operators allowment allowment of possibility for a hypothesis all-axiom algebraic grammars all-bidirectional-edges all-covers problem all-pairs shortest-path problem all-zero word almost almost all oracle sets almost confluent system almost cylindrical languages almost everywhere almost everywhere complexity almost everywhere continuous function almost everywhere difficult to decide almost optimal circuits almost orthogonal rewriting systems almost periodic almost periodic recognizable sets almost periodic sets almost polynomial time almost P-immune almost surely almost uniform generation almost-confluent Thue almost-confluent Thue system almost-equal-delay race model almost-everywhere complexity hierarchies almost-everywhere complexity hierarchy almost-R complexity classes ALNA ALNA Alna ALOGTIME ALOGTIME-uniform setting ALOGTIME-uniform set-theoretic/algebraic characterizations ALOHA ALOHA ALOHA collision resolution algorithm ALOHA resolution algorithm Alonso Alonso (α, k)-machine α0-ν1-products of automata α0-products ,1490 α-η convertible α-acyclic scheme α-recursion alphabet of the alphabet of the actions alphabet of the synchronization alphabeth alphabeths alphabetic alphabetic alphabetic homomorphism alphabetic homomorphism theorem alphabetic homomorphism theorem for hyper-algebraic extensions alphabetic homomorphisms alphabetic morphism alphabetic morphisms alphabetic transductions alphabetic tree alphabetic tree problem alphabetic tree relations alphabetic trees alphabetical alphabetical FIFO nets alphabets alphabets alpha-congruence alternating alternating alternating alternating 1-inkdot Turing machines alternating automata alternating automata on infinite trees alternating bit protocol alternating cellular automata alternating complexity classes alternating computations alternating context free grammar alternating context free languages alternating context-free alternating context-free grammar alternating context-free grammars alternating context-free languages alternating decision trees alternating finite alternating finite automata alternating finite automaton alternating fixpoints alternating log space alternating logspace hierarchy alternating machine alternating machines alternating machines with universal states only alternating model alternating multicounter machines alternating multihead finite automata alternating multi-stack-counter automata alternating occurrences alternating one-way top-down automata alternating on-line Turing machines alternating pushdown automata alternating pushdown automaton alternating quantification alternating simple multihead finite automata alternating simple multihead finite automaton alternating time alternating time-space complexity alternating TM alternating tree automata alternating Turing machine alternating Turing machine with only universal states alternating Turing machine with ony universal states alternating Turing machines alternating Turing machines with a bounded number of alternations alternating two-way finite alternating two-way finite automata alternating two-way finite tree automata alternating two-way pushdown tree automata alternation alternation alternation between universal and existential states alternation depth alternation versus alternation versus determinism alternation versus nondeterminism alternations alternations alternations of max and min alternations on inputs alternative alternative alternative characterization of sequential functions alternative composition alternative model theories alternative operator alternatives alternatives Alton Alton Alur Alur and Dill always operator always operator in temporal logic AM AM AM = MA amalgamated amalgamated product amalgamation amalgamation ambiguities ambiguities ambiguity ambiguity ambiguity behavior ambiguity degree two ambiguity in E0L systems ambiguity of ambiguity of a grammar ambiguity of context-free languages ambiguity of E0L languages ambiguity of finite automata ambiguity of nondeterministic finite acceptors ambiguity of number systems ambiguity of pushdown tranducers and acceptors ambiguity problem ambiguity problem for context-free languages ambiguity problems ambiguity question ambiguity question for context-free languages ambiguous ambiguous ambiguous E0L languages ambiguous E0L systems ambiguous grammar ambiguous language ambiguous languages ambiguous product ambiguously ambiguously covered Ambos Ambos-Spies Ambos-Spies et al. America America and Rutten amino amino acids Amir Amir amortization amortization argument amortized amortized amortized complexity amortized efficiency amortized time amortized time complexity an implementation space depth in analog analog analog automata analog automaton model analog circuits analog computation analog devices analog environment analog machines analog networks analog shift map analogical analogical analogical correspondence analogical program derivation analogical programming analogical reasoning analogon analogon to domain analogue analogue of Pin's result analogues analogy analogy calculus analogy correspondence analogy matching method analyses analysing analysis analysis efficiency analysis of analysis of algorithms analysis of formal proofs analysis of text analysis of worst case analytic analytic analytic estimates of the complexity of node searches analytic functions analytic models analytic number theory analytic properties analytic results analytic structure analytic system analytic tableaux analytical analytical hierarchy analytical systems analytical techniques anamorphism anamorphisms anamorphisms ANC ancestor ancestors and complete semantics AND gates and rational expressions of and/or graph accessibility problem AND/OR graphs and/or special purpose databases AND/OR/NOT circuits ∧-nodes ∧-words Anderaa Andre´ka Andre´ka and Ne´meti Andre´ka Ne´meti and Sain Andre´ka, Ne´meti and Sain Andréka Andrews Andrews AND-compositional program analysis AND-control automata AND-gate AND-gates AND-OR causality Anf Anf language operator angelic angelic choice angelic nondeterminism angels angels angle Angluin Angluin Angluin characterization of learnable families Angluin machine learning algorithm Angluin's learning algorithm Angluin's learning family of languages Anguin angular angular 2-structures animals animals annealing annealing annotate state-transition graphs annotated annotated atoms annotated logics annotated nonmonotonic rule systems annotated program transformations annotated programs annotating state-transition graphs annotations method anomalies anomalies anomalies in programs anomalous anomalous learning anonymous anonymous anonymous network anonymous wireless rings answer constraints answer set semantics answer substitutions antichains antichains anticovers anticovers Antimirov Antimirov antipodes antipodes antirandomization antirandomization anti-Dyck generator anti-exceedance anti-exceedance distribution anti-exceedance statistic anti-foundation axioms anti-founded model for SCCS APA APA-net APDA APDA aperiodic aperiodic aperiodic cellular automata aperiodic monoids aperiodic rational relation aperiodic real trace languages aperiodic semigroups aperiodic tasks aperiodic trace languages aperiodic word aperiodicity aperiodicity apex apex eNCE graph apex eNCE graph grammars apex eNCE graph language Apostolico Apostolico Apostolico and Giammarresi and Restivo Apostolico and Giancarlo Apostolico et al. Appel Appel and Haken applicability applicability conditions applicability of productions applicability of Valiant's equivalence decision procedure application application condition application fields application of completion application operator application perturbation applications applications of open ear decomposition applications to polynomial evaluation applicative applicative bisimulations applicative language applicative programming language applicative structure applied calculus approximability approximability approximability classes depending on relations and constraints approximability of finding maxima approximability of the highest degree subgraph problem approximability properties of NPOP's approximability results approximability schemes for NPOP's approximable approximable approximable mappings approximable problems approximable relations approximant approximants approximants approximate approximate approximate algorithm for matrix multiplication approximate algorithms approximate answer substitutions approximate array matching approximate complexity approximate complexity analysis approximate computations approximate congruence approximate consensus approximate counting approximate counting of colourings approximate counting problem approximate decision procedures approximate dependency inference approximate geometric sorting approximate greedy algorithms approximate identification of regular languages approximate inference approximate Newton iteration approximate occurrences of patterns approximate parallel computation approximate programs approximate searches approximate solution approximate string matching approximate string matching problem approximate string-matching approximate string-matching algorithm approximate symmetry approximate testing approximate testing of concepts approximate tree automorphisms approximate zero approximately approximately approximately regular languages approximately testable concept class approximating approximating approximating CCP programs approximating elements approximating location problems approximating Markov chains approximating Markov chains by deterministic models approximating sets approximating sets with equivalence relations approximating shortest superstrings approximation approximation approximation algorithm approximation algorithm for approximation algorithm for clustering approximation algorithm for TSP approximation algorithms approximation algorithms for approximation algorithms for arithmetic combinatorial problems approximation algorithms for weighted matching approximation by approximation by circuits approximation by computation trees approximation by enrichment approximation by rational functions approximation class approximation classes approximation degree approximation errors approximation given by an interpreter approximation in approximation in databases approximation in graph algorithms approximation in terms of queries approximation induction principle approximation measure approximation model approximation models approximation of approximation of algebraic numbers approximation of an expression in a model approximation of Boolean functions approximation of irregular meshes approximation of languages approximation of longest common factor approximation of nonlinear dynamic systems approximation of polynomials approximation of rectangular meshes approximation of solutions of polynomial equations approximation of tensors approximation of the stable core approximation order approximation preserving approximation preserving reducibilities approximation problem approximation problems approximation properties approximation properties of abstract data types approximation ratio approximation sequence approximation space approximation spaces approximation technique for NP-hard problems approximation techniques approximation tests of approximation tests of cocircularity approximation tests of collinearity approximation theory approximation to a metacircular interpreter approximations approximations approximations of NPOP's approximations to NP-complete problems approximation-preserving reductions approximative approximative approximative algorithm approximative complexity approximative model approximative triadic decompositions approximative triadic decompositions of tensors aproximation APS APS APT APT Apt Apt Apt and van Emden Apt Blair and Walker Apt Bol and Klop APX APX arbiter arbiters arbiters arbitrarily complex languages arbitrarily complex minimal pairs arbitrarily large prime programs arbitrary fan-in arbitrary fan-in arithmetic computations arc arc geography architectural architectural clusters for parallel machines architecture architecture architectures architectures arcs arcs arctical arctical semiring area complexity area complexity of area complexity of Boolean circuits area complexity of merging area complexity of sorting area inclusion order area-time area-time squared area-time tradeoffs area-time trade-offs argument reduction argument selection argument subexpressions argument tuples Aristotle Aristotle's Aristotle's syllogisms arithmetic arithmetic arithmetic circuit depth arithmetic circuits arithmetic complexity arithmetic formula arithmetic functions arithmetic gates arithmetic hierarchy arithmetic hierarchy of formulas arithmetic hierarchy of formulas in prenex normal form arithmetic machine models arithmetic model of computation arithmetic of arithmetic of matrices arithmetic of reversed positional games arithmetic of Sturmian words arithmetic on semirings arithmetic operations arithmetic plane arithmetic progression arithmetic properties of the integers arithmetic sequences arithmetic straight-line programs arithmetic strategies for arithmetic strategies for winning Wythoff games in mise´re play arithmetic strategies for Wythoff games arithmetical arithmetical arithmetical axiomatization arithmetical axiomatizations arithmetical characterization of NP arithmetical combinatorial problems arithmetical completeness arithmetical completeness of Harel arithmetical complexity arithmetical constraints arithmetical formula arithmetical fragment arithmetical functions arithmetical hierarchy arithmetical operations arithmetical queries arithmetical set arithmetical theories arithmetically arithmetically complete and sound proof systems arithmetics arithmetics arities arity arity Armstrong Armstrong relation Armstrong relations Arnborg Arnborg Arnold Arnold Arnold and Arnold and Dicky Arnold and Nivat Arnold's monoid Arnold's syntactic congruence Arnold-Dicky's saturating homomorphisms Arqu Arqučs arrangement arrangement of distinct objects on a circle arrangements arrangements of curves arrangements of curves in the plane array array array assignment instructions array assignments array assignments in dynamic logic array automata array language array languages array maintenance problem array matching array matching problem array of array of finite-state machines array of read-only memory array pattern matching array server array systems with control array values arrays arrays arrays arrays as graphs arrays of processors arrival arrival and departure instants arrival instant measures arrival instants arrival permutations arrival time arriving arriving bit arriving customers arriving tasks arrows arrows arrows abstract computations Arsac Arsac Arthur Arthur-Merlin hierarchy articulation articulation points artificial artificial intelligence artificial intelligence applications artificial neural networks Artin Artin local rings Artin-Schreier curves ascceptors ascceptors with outputs ascending ascending ascending chain in a poset ascent Ashcroft Ashcroft Ashcroft and Manna Ashenhurst Ashenhurst decomposition Ashenhurst decomposition of switching Ashenhurst decomposition of switching functions Askey Askey-Gasper inequality ASL ASL ASL-like kernel language for structured specifications ASPACE ASPACE Asperti Asperti ASPMHFA ASPMHFA ASPMHFA's assemblies assembly Asser Asser's Asser's problem asserted program assertion assertion graphs assertion language assertion method for logic programs assertion semantics assertional assertional assertional categories assertional proof system assertional reasoning assertional s-rings assertions assertions about programs assigning assigning probabilities to arguments assigning semantics to a class of statements assigning subtasks assignment assignment assignment of tasks to processors assignment of types to variables assignment problem assignment problem without deadlines assignment statement assignment statements assignment systems assignments assignments assignments to while-programs assisted program construction associated language of a Turing machine associative associative associative algebras associative multiplication problems associative-commutative function symbols associative-commutative properties associativity associativity associativity of disjunction associativity result for network construction assumption of orthogonality assumption/guarantee specification assumption-based reasoning asteroidal asteroidal triple-free graphs asymmetric asymmetric asymmetric conflict asymmetric confusion asymmetric Hopfield model asymmetric Hopfield net asymmetric interunit connections asymmetric multiway digital search tree asymmetric switch asymmetric treatment of input and output asymmetrical asymmetrical types of influence asymmetry asymmetry index asymptotic asymptotic asymptotic acceleration of matrix asymptotic acceleration of matrix multiplication asymptotic acceleration of matrix operations asymptotic analysis of list structure properties asymptotic approximations asymptotic average length asymptotic behavior asymptotic behavior of asymptotic behavior of networks asymptotic behavior of the unstable queue asymptotic behaviour asymptotic behaviour of asymptotic behaviour of complexity measures asymptotic behaviour of discrete systems asymptotic birth-and-death equations asymptotic complexity asymptotic complexity of asymptotic complexity of matrix multiplication asymptotic complexity of rectangular matrix multiplication asymptotic cost of the standard Gaussian elimination algorithm asymptotic densities asymptotic distribution of search cost asymptotic distributions asymptotic efficiency asymptotic equality asymptotic estimates asymptotic estimations asymptotic estimations of the number of prefixes in free partially commutative monoids asymptotic evaluation of the average cost asymptotic expansion asymptotic expansions asymptotic expression asymptotic forms asymptotic formula asymptotic improvements asymptotic limiting distribution asymptotic lower and upper bounds asymptotic lower bounds asymptotic methods asymptotic model asymptotic normal distributions asymptotic optimal HEAPSORT algorithm asymptotic probabilities asymptotic probabilities of sentences asymptotic properties of keys asymptotic representations of solutions asymptotic results in combinatorics asymptotic solution asymptotic theory asymptotic time complexity asymptotic worst-case analysis asymptotically asymptotically optimal asymptotically optimal algorithms asymptotically optimal on-line algorithm asymptotically optimal parallel algorithms asymptotically optimal sequential algorithms asymptotically work-optimal asymptotics asymptotics asymptotics of asymptotics of insertion costs asymptotics of the average length of maximum common subsequences asynchronous asynchronous asynchronous agents asynchronous approach asynchronous arbiter problem asynchronous automata asynchronous behavior asynchronous behaviour asynchronous cellular automata asynchronous cellular automata accepting trace languages asynchronous cellular Bu¨chi automata asynchronous circuits asynchronous communicating processes asynchronous communication asynchronous composition asynchronous computation asynchronous control modules asynchronous distributed systems asynchronous environment asynchronous interaction asynchronous model asynchronous ND automata asynchronous parallel asynchronous parallel algorithms asynchronous parallel automata net asynchronous parallel automata nets asynchronous parallel composition asynchronous parallel product asynchronous parallel programs asynchronous parallel systems asynchronous parallelism asynchronous PRAM asynchronous probabilistic systems asynchronous processed jobs asynchronous processes asynchronous programming constructs asynchronous reduction process asynchronous rings of processors asynchronous semantics asynchronous shared memory systems asynchronous systems asynchronous threshold logic networks asynchronous transition systems asynchronously asynchronously in parallel operating processes asynchrony asynchrony asynchrony calculus asynchrony of the output operation AT2 bound Atiya Atkinson Atkinson algorithm for towers of Hanoi problem ATM ATM ATM with modified acceptance ATM's ATM's ATMs atom atom atomic atomic atomic actions atomic actions for CCS atomic Boolean algebras atomic data types atomic database updates atomic events atomic formulae atomic formulas atomic instructions atomic normal form atomic normal form DPDA's in atomic pieces of patterns atomic programs atomic register atomic schemes atomic semicommutations atomic statements atomic terms atomic tests atomic updates atomic values atomicity atomicity atomicity assumption atomicity assumptions atomicity of transaction executions atomicity properties atomless atomless Boolean algebras atoms atoms atoms in a Boolean algebra atoms of a lattice ATP ATP attainable states Attiya attraction attraction basins attractor attractor attribute attribute attribute evaluation attribute grammar attribute grammars attribute models attribute models of formal languages attribute set attribute sets attribute system attribute tree attribute values attributed graphs attributed tree attributed tree grammars attributed tree transducers attributes attributes attribute-oriented induction method Aubin Aubin auditing auditing auditing for databases audits audits augmentation augmentation augmented augmented counter machines augmenting augmenting Horn-clause logic Ausiello Ausiello and Moscarini Autebert Autebert et al. authentication authentication problem authentication problem of Diffie and Hellman authorized authorized # tiles authorized parallelism autocorrelation autocorrelation coefficient autodistance autodistance of words autodistances autodistances autoepistemic autoepistemic autoepistemic logic autoepistemic semantics autoepistemic translations automata automata automata associated with varieties of finite monoids automata Bu¨chi automata automata boustrophredonic automata causal automata automata Cayley automata automata cellular automata automata chain automata automata classes of automata automata complete classes of automata automata for ω-languages automata from regular expressions automata languages automata networks automata of logic programs automata on free products of monoids automata on infinite trees automata on trees automata on words indexed by ordinals automata over a finite semigroup automata recognizing almost periodic sets automata synchronizers automata synchronizers syntactic near rings of automata automata synchronizers tessellation automata automata theory automata theory for two-person games automata with automata with bounded automata with bounded behaviour automata with bounded delay automata with concurrency relations automata with distance functions for string-matching automata with distributed control automata with finite transformation semigroup automata with infinite states automata working on trees automata-free description automata-free description of Wagner's fine structure automata-like regular expressions automated automated automated deduction automated deduction methods automated deduction systems automated design of reactive system algorithms automated finite-state verification automated learning automated manufacturing of woven fabric automated proof automated reasoning automated reasoning with equality automated strategy automated symbolic computation automated symbolic computations automated techniques automated theorem proving automated theorem-proving program Automath Automath-like systems automatic automatic automatic analysis of programs automatic average-case analysis of algorithms automatic compiler generation automatic construction of type checkers automatic derivation of formulas automatic differentiation automatic generation of automatic generation of finite-element code automatic generation of invariants automatic generation of receivers automatic improvement automatic improvement of performance automatic inductive theorem proving automatic parallelisation of sequential programs automatic parallelization automatic program automatic program synthesis automatic program transformations automatic proof automatic proof construction automatic proof procedures automatic proving of geometric structure automatic real number automatic reals automatic reasoning automatic search automatic self-stabilization automatic sequence automatic sequences automatic synthesis automatic unfolding algorithm automatic uniform synthesis paradigms automatic verification automatic verification tools automatic word automaticity automaticity automaticity of double sequences automating automating automating mildly complex proofs automating the construction of programs automation automation of program automation of program optimization automation of program proofs automatized automatized program synthesis automatizing automatizing termination proofs automaton automaton automaton controlled IFS automaton deterministic with respect to the input automaton models automaton of a automaton of a complement automaton of a union automaton of an automaton of an FTR language automaton of an intersection automaton of vector fields automaton process automaton size automaton with concurrency relations automaton with registers automaton-definable relations automorphism automorphism group automorphism group of context-free graphs automorphism groups automorphism groups of automata automorphism groups of hypermaps automorphisms automorphisms autonomous autonomous actions autonomous agents *-autonomous categories autonomous deductive system autonomy autonomy of choices auto-concurrency auxiliary assertions auxiliary delay variables auxiliary invariants auxiliary process algebra operators auxiliary processors auxiliary space auxiliary theorems availability of high level declarative query languages availability of high-level declarative query languages Avalon Avalon system average average average behaviour of algorithms average case average case algorithm average case analysis of algorithms average case complexity average case cost average case deterministic parallel comparison complexity of merging average case model for linear optimization average case performance average case randomized parallel comparison complexity of merging average complexities average complexities of update and retrieve transactions average complexity average complexity of digital search trees average complexity of transactions average cost average cost of operators average costs average fan-out average information rate average length average length of the k-th longest cycle in a permutation average message complexity values average number average number of average number of iterations average number of multiplications average number of prefixes average number of rebalancing operations average number of slots average parallelism average path length average polynomial time average polynomial time complexity average running time average running time behaviour average service times average size average size of an inductive function average time complexity averages averages of inter-arrival times average-case average-case analysis average-case analysis of average-case analysis of algorithms average-case analysis of MAT average-case analysis of search games average-case complexity average-case complexity theoretic arguments average-case computation time average-case computational complexity average-case pattern matching average-case running times AVL AVL trees avoidable avoidable patterns avoidable words avoidance of avoidance of deadlock avoidance of divergence avoiding slack variables aware Awerbuch Awerbuch Axiom Axiom axiom axiom Axiom computer algebra system axiom of choice axiom scheme axiom schemes axiom system axiom system # axiom system ACPτ axiom system ACPε axiom system BPAε axiom system for equalities between rational sets axiom system for rational sets with axiom system for rational sets with multiplicities axiom system PA axiom systems axiom word axiomatic axiomatic axiomatic approach to specification languages axiomatic characterization axiomatic characterization of stable semantics axiomatic characterization of system behaviour axiomatic definition of axiomatic definition of context-free rewriting axiomatic definition of interpretation axiomatic definition of processes axiomatic formulation of closed semirings axiomatic framework axiomatic model axiomatic process semantics axiomatic proof formalism axiomatic properties of pomsets axiomatic semantics axiomatic semantics for axiomatic semantics for CSP axiomatic semantics for standard pure Prolog axiomatic theory of axiomatic theory of sets axiomatic theory of the noninterleaving behaviour of Petri nets axiomatic treatment axiomatic treatment of recursive function theory axiomatic treatment of restriction axiomatically axiomatically based based calculus of operations axiomatically based calculus of operations axiomatisation axiomatizability axiomatizability of first-order temporal logic axiomatizable axiomatization axiomatization axiomatization for axiomatization for extended computation tree logic axiomatization for proving properties of programs axiomatization for timed bisimulation axiomatization in LCF axiomatization of axiomatization of a first order logic of effects axiomatization of aggregation constraints axiomatization of algebras of processes axiomatization of behavioural equality axiomatization of concatenable processes axiomatization of metric temporal logic axiomatization of PDL axiomatization of systolic systems axiomatization of temporal logic axiomatization of tests axiomatization of the properties of a total space axiomatizations axiomatizations axiomatizations of axiomatizations of algorithmic logic axiomatizations of arithmetic axiomatizations of concurrent dynamic logic axiomatizations of dynamic logic axiomatizations of logics of programs axiomatizations of temporal logic axiomatized axiomatized repetition axioms axioms axioms for axioms for a axioms for a CTS axioms for a parallel programming language axioms for ACPτ axioms for action alphabets axioms for admissible representations axioms for combinations of theories axioms for communicating processes axioms for feedback axioms for Go¨del numberings axioms for general logic programs axioms for iteration theories axioms for language matching axioms for mixed computation axioms for module components axioms for processes axioms for reasoning about combinations of dependencies axioms of axioms of computation axioms of Euclidean geometry axioms of iteration theories axioms of relational algebra axis axis-parallel rectangles Axt Axt generalized hierarchy Ayer Ayer Ayers Ayers A-LAGs a-product a-quotient A-semilinear a-space Be´zout inequality Be´zout's theorem Bo¨hm Bo¨hm and Jacopini Bo¨hm model of the lambda calculus Bo¨hm-Berarducci embedding Bo¨hm-like models Bo¨hm-trees of λ I-terms Bu¨chi Bu¨chi acceptance Bu¨chi acceptance condition Bu¨chi automata Bu¨chi's second-order formulas Bu¨chi's theorem Bu¨chi-like theorem Bu¨chi-McNaughton theorem B+-trees Babai Babai's Babai's Arthur-Merlin hierarchy Bach Bach Bachmair Bachmair background knowledge backoff backtracking backtracking backtracking facilities backtracking type Backus Backus's Backus's functional programming system backward backward backward chaining backward determinism backward deterministic backward deterministic cellular automata backward deterministic CM's backward modalities backward movement backward propagation back-of-the-envelope timing diagrams Baeten Baeten Baeten and Bergstra Baeten et al. bagdomain bagdomain bagdomain construction bagdomain theme bags bags Bainbridge Bainbridge dinatural approach to modelling polymorphic types Baird Baird Baire Baire Baire category Baire category analogue Baire category theorem Baire metrics Baire property Baire space Baker Baker Baker and Book Baker and Selman Baker et al. Baker's algorithms Baker's method Baker's theory of parameterized string matching Baker's theory of parametrized string matching Baker, Gill and Solovay Bakker balance balance balance of balance of many-valued transductions balance of two morphisms balance property balance property of Patricia tries balanced balanced model balanced probability model balanced trees balancedness balancedness of digital trees balancing balancing Balc Balca´zar Balca´zar et al. ballistics ballistics balls Balzer Balzer Banach Banach's fixed point theorem banana Banâtre Banâtre and Le Me´tayer Bancilhon Bancilhon and Paredaens banded matrix bandwidth bandwidth bandwidth constrained NP-complete problems bandwidth constraints bandwidth minimization bandwidth of bandwidth of communication lines bandwidth of graphs bandwidth of well-formed formulae bandwidth restricted satisfiability bandwidth restrictions Banyan Banyan network Banyan networks barbed barbed bisimulation barbed equivalence barbed semantics Barendregt Barendregt Barendregt et al. Barendregt and Myhill Barendregt's Barendregt's cube Barkaton Barkaton and Jung Barnard Barnard and Cordy Barnsley Barnsley's Barnsley's IFS method Barrett Barrett's Barrett's fixed point theory Barrington Barrington Barrington Immerman and Straubing Barrington's Barrington's M-program model Barua Barua Barzdin Barzdin Bar-On Bar-On and Vishkin BAS BAS BAS mechanism Basarab Basarab based algebraic cpo's based semantics baseline baseline network baseline networks baseline-equivalent multistage interconnection networks bases bases bases for bases for free Lie algebras bases for Hamming codes bases of bases of Boolean functions bases of components of a net bases of integers bases of number systems bases of right sub-KA-modules bases of two input Boolean functions bases of two-input Boolean functions bases of unifiers base-k expansion of n basic basic 2-structures basic Bessel functions basic block optimization basic categorial grammars basic combinators basic completion basic components of a net basic concepts basic decision problem basic elements of temporal logic basic Euclidian operations with compass and ruler basic families of recognizable sets basic functions basic monotone Boolean NP-complete functions basic operations basic operations on natural languages basic parallel processed jobs basic parallel processes basic PRAM basic progam equivalences basic program equivalences basic programs basic properties of 2-structures basic recursive function theory basic semantics basic sets basic sets of assumptions basic subclasses basics of bounded languages basin basin of attraction basins basis basis conversion method Batcher Batcher's Batcher's bitonic sorting network batteries batteries of tests battery battery of tests Baudet Baudet and Chen Baunwall Baunwall, Bertelsen and Weibel Bayesian Bayesian network Bayesian network inference algorithms BC BC inference BCm inference BCD BCD type assignment system BCD-system BCF BCF BCF languages BCH BCH codes BCI BCI-logic BCK BCK logic BCK-λ-terms BCK-combinators BCK-formulas BCK-provable formulas BCNF BCNF BCNF set of functional dependencies BCNF-families BCNF-families union of BCNF-families BCT BCT, theory of bounded concatenation BC-type inductive inference BD BD BD files BDD BDD BDD class BDD classes BDD's BDDs BDT BDT Beatty Beatty Beauchamps Beauquier Beauquier Beauquier and Beauquier and Nivat Beauquier and Perrin Beauzamy Beauzamy, Frot and Millour becoming Beeson Beeson's Beeson's EON beginning of events behavedness behavior behavior behavior at infinity behavior of behavior of 2DPDA's behavior of concurrent systems behavior of coordinators behavior of distributed systems behavior of execution times behavior of heuristics behavior of nondeterministic algorithms behavior of programs behavior of random edge cuts behavior of real time systems behavior of real-time systems behavior of synchronous systems behavior of systems in terms of their components behavior of the environment behavior structures behavior structures temporal character of a program's behavior behavioral behavioral behavioral equivalence behavioral reduction behaviorally behaviorally equivalent behaviors behaviors modulo stuttering behaviors of flowchart algorithms behaviors of probabilistic I/O automata behavior-realization adjunction behaviour behaviour behaviour matrix behaviour models behaviour of behaviour of a behaviour of a machine behaviour of a Petri net behaviour of a recursively defined expression behaviour of a system behaviour of a VCCS behaviour of asynchronous processes behaviour of circuits behaviour of concurrent systems behaviour of distributed systems behaviour of elementary net systems behaviour of general Petri nets behaviour of models of concurrency behaviour of nets behaviour of nondeterministic algorithms behaviour of nondeterministic processes behaviour of Petri nets behaviour of PT-nets behaviour of recursive rules behaviour of systems behaviour of the behaviour of the controlled system behaviour of the density function of repetition-free words behaviour of unfoldings of regular expressions behavioural behavioural behavioural abstraction behavioural abstraction from a specification behavioural aspects of net theory behavioural descriptions behavioural descriptions of distributed systems behavioural equality of objects behavioural equivalence behavioural equivalence relation behavioural equivalences behavioural implementation relations behavioural implementations behavioural level behavioural properties behavioural satisfaction behavioural semantics behavioural specification language behavioural specifications behavioural theorems behavioural theories behavioural theory of any class of algebras behavioural tools behavioural validity of first-order formulas behavioural view of concurrent systems behaviours behaviours of behaviours of concurrent programs behaviours of concurrent systems behaviours of machines behaviours of real-time applications Beigel Beigel Beigel et al. Beimel Beimel and Chor Beimel-Chor schemes Bel'tyukov Bel'tyukov's stack register machines Belady Belady's Belady's algorithm belief belief about knowledge belief revision Bell Bell polynomials Belmesk Belmesk Belnap Belnap's four-valued logic Belnap's logic benchmarks benchmarks Bendix benefits of modelling queueing systems Bennet Bennett Bennett Bennett and Gill Bennett's Bennett's Bennett's notion of computational depth Bennett's simulation of deterministic Turing machines Benoit Benoit Benson Benson and Tiuryn bent Bentley Bentley and McGeogh Benyelles Benyelles Ben-David Ben-David et al. Ben-David et al. completion Ben-Or Ben-Or Berarducci Berge Berge's positional games Berge-acyclic view Bergstra Bergstra Bergstra and Bergstra and Klop Bergstra and Tucker Bergstra et al. Bergstra et al. Baeten and Bergstra Bergstra-Klop free process algebras with silent actions Berkowitz Berkowitz Berlekamp Berlekamp Berlekamp et al. Berlekamp factorization algorithm Berlekamp's inequality Berlekamp-Massey problem Berman Berman Berman and Hartmanis Berman complexity class Bern Bern Bernays Bernoulli Bernoulli Bernoulli measure Bernoulli model Bernoulli morphisms Bernoulli polynomials Bernoulli proces Bernoulli shifts Bernshtein Bernshtein, Kushnirenko, Khovanskii bound Bernshtein-Kushnirenko-Khovanskii bound Berry Berry Berry and Sethi Berry's category of dI-domains Berry-Boudol chemical abstract machine Berry-Curien sequential algorithm Berry-Sethi algorithm Berry-Sethi family of languages Berstel Berstel Berstel and Berstel and Mignotte Berstel and Perrin Berstel and Reutenauer Berstel's Berstel's theorem Bertelsen Bertrand Bertrand Bertrand numeration systems Bessel Bessel functions Bessis Bessis, Mehta and Moussa best best bounds best commutative approximate algorithm for matrix multiplication best competitive guarantee best nonoverlapping alignment score best reduction best sequential algorithm best sequential algorithm of Rose et al. best testable circuit best time interval best-known best-known algorithms best-known upper bounds beta rules β numeration systems βη rules of polymorphic lambda calculus βη-convertibility βη-expansion βη-invertible terms βη-normal forms βη-reduction βη-solvability problem βη-solvable β-conversion β-derivations β-equality β-equality rule β-expansions β-normal form β-numbers β-redexes β-reduction β-reduction in combinatory logic β-reductions β-solvability problem β-solvable β-triangles beta-acyclic beta-acyclic database scheme beta-acyclic scheme beta-cycles beta-cycles in a database scheme beta-equal beta-equal λ-I-terms Betti Betti numbers Bezem Bezem and Veldman Bézout Bézout's BFO BFO BFO circuits biaccessible biaccessible G-schemes biadherence biadherence bias of a battery of tests biased coins Bibel Bibel Bibel's Bibel's connection graph bibliography bibliography of L systems bicartesian bicartesian squares bicentre bicentre of a language biconditional biconditional biconnected biconnected biconnected components of graphs biconnected graph biconnected outerplanar graphs biconnected planar graph biconnected subgraph biconnection biconnectivity biconnectivity augmentation problem bidelta bidelta networks bidimensional bidirectional bidirectional communication channel bidirectional rings bidirectional rings of processors Bidoit Bidoit et al. Bieberbach Bieberbach conjecture bifaithful bifaithful trio bifinite bifinite domains bifix bifunctor bifunctor bifurcation bifurcation phenomena bifurcation ratio bifurcation ratio of binary trees Biggins Biggins' first- and last-birth problem bijection bijective bijective bijective expansive TMT bijective proof bilateral bilateral center of a language bilateral centers of languages bilateral semidirect bilateral semidirect decomposition bilateral semidirect products bilattice bilattice based logic programs bilattices bilattices bilimit bilimit bilimits bilimits of recognizable languages bilinear bilinear bilinear aggregation bilinear algorithms bilinear approximation bilinear circuit-size complexity bilinear complexity of multiplication in finite fields bilinear form bilinear forms bilinear mappings bilinear mincing rank bilinear system billiard billiard trajectories billiards billiards in the billiards in the half equilateral triangle billiards in the isoceles right angle triangle Billingsley Billingsley dimension bimatrix bimatrix equilibria in games bimorphisms bimorphisms BIN1 BIN1 binary binary binary alphabets binary Boolean operations binary choice operator binary composition operator binary concurrency relations binary conjunction binary containment binary containment inference binary decision binary decision diagram binary decision diagrams binary decision free binary decision diagram binary decision real time binary decision diagram binary decision tree binary decision trees binary disjunction binary disjunctions in the quantifier free matrix binary encoding binary encoding scheme binary expansion binary expansions binary exponential backoff binary form binary function constant binary grammatical codes binary grammatical codes of trees binary hypercube binary images binary inevitability properties binary language binary languages binary monotone consensus binary morphisms binary multiple-choice knapsack packing problem binary multiple-choice knapsack problem binary network flow problem binary operations binary operator binary Patricia trie binary Patricia tries binary periodic synchronizing sequences binary predicate binary predicate symbols binary race analysis binary random string binary recursive rules binary relation binary relations binary relations in relational databases binary representation binary representations binary residual operation on transitions binary resolution binary rules binary search binary search tree model binary search tree model of probability binary search trees binary sequence binary sequences binary string binary string measures binary systolic tree automata binary timing pulse binary tournaments binary tree binary tree networks binary tree networks of memoryless processors binary trees binary tree-connected network binary tree-connected network with sequential input and output binary word type binary worktape alphabet binding binding binding structures binding symbols creating local scopes binding time binding time analysis binding times bindings bindings bindings of arguments binding-passing behavior Binkowska Binkowska binomial binomial coefficients binomial queues bintree bintree biocomputing biocomputing area biological biological biological context biological function biological interpretation of Lindenmayer systems biological organisms biological schemes biological schemes with cellular interactions biological sequence biology biology biophysics bipartite bipartite bipartite degree-restricted digraphs bipartite graph bipartite graphs bipartite map bipartite networks bipartite order bipartite permutation graphs bipartite planar graphs bipartitioning biplanar biplanar biplanar drawing biplanar subgraph bipolar bipolar bipolar coefficients bipolar synchronization schemes biprefix biprefix biprefix code biprefix codes biprefix codes of words biprefix encodement biprefix sets of paths in a graph biquadratic biquadratic method biquadratic method of Book et al. Biran Biran Birkhoff Birkhoff Birkhoff and Lipson Birkhoff calculus Birkhoff equational calculus Birkhoff's Birkhoff's decomposition theorem Birkhoff-like deduction theory Biró Biró birth and death type equations birth-and-death equations bisections bisections bishop bisimilar bisimilar LTS bisimilarities bisimilarities bisimilarity bisimilarity bisimilarity of normed bisimilarity of normed context-free processes bisimilarity of normed unary processes bisimilarity undecidability of bisimilarity for Petri nets bisimular bisimular processes bisimulation bisimulation bisimulation based semantics bisimulation class bisimulation congruence bisimulation equivalence bisimulation equivalence classes of trees bisimulation equivalences bisimulation of groups bisimulation of open terms with finite-state recursion bisimulation relation bisimulation semantics bisimulations bisimulations bisimulation-based bisimulation-based congruences bisimulation-based equivalence bisimulation-based semantics bisimulation-equivalence bisimulation-like equivalences bispecial bispecial elements bispecial Sturmian words bistable bistable asynchronous devices bit bit directed routing bit operations bitonic bitonic sort bitonic sort family of languages bitonic sorting algorithm bits bivariate bivariate generating function bi-ω-languages bi-adherence bi-enumerable bi-Greibach normal form bi-immune bi-immune for P bi-immunity bi-immunity results for cheatable sets bi-infinite bi-infinite application bi-infinite derivation bi-infinite number bi-infinite paths bi-infinite power bi-infinite power of languages of finite words bi-infinite rational closure bi-infinite sequences bi-infinite words bi-infite G-derivation bi-synchronizing presentation Bjo¨rner BJn schemes Björner BKK BKK bound black black boxes black pebble black pebble game black-box group black-box group problems black-white pebble game Blair Blair and Blair and Kunen Blair and Subrahmanian Blanchard Blanchard Blanchard and Fabre Blanchard and Hansel blind blind blind choice operator blind counter blind machine blind machines blind multicounter machines blind one-way multicounter machines block block block diagonal block edit block edit distance block edit models block expressions block graphs block in a word block matrix multiples block of cells block structure in programming languages block structured block structured language block structured language with local variables block structured programming languages block structured programs blocked blocked blocked jobs blocked matrix multiplication blocked multiplication blocking blocking blocking in basic completion blocking networks blocking of machines blocking probabilities blocks blocks blocksize block-pumping property Blom Blom Bloom Bloom Bloom and Bloom and Elgot Bloom and Tindell Blum Blum Blum and Marques Blum et al. Blum et al. speedup Blum et al. speedup Turing machine of Blum et al. Blumer Blumer Blumer et al. Blum-Shub-Smale model Blum-Shub-Smale model of computation Blundo Blundo et al. BM BM time BNP BNP family of languages board Boasson Boasson Boasson and Nivat Boasson Courcelle and Nivat Boasson, Courcelle and Nivat bodies of bodies of nested loops bodies of rules Bodlaender Bodlaender and van Leeuwen Boffa Boffa Böhm Bol Bol Bonner Bonner and Kifer Book Book and Book and Mayordomo Book and O'Dunlaing Book and Wrathall Book et al. Boolean Boolean Boolean algebra Boolean algebra closed under quotients Boolean algebra of Boolean algebra of describable sets Boolean algebras Boolean and/or/not formulae Boolean arguments Boolean automata Boolean bases Boolean branching program model Boolean calculus Boolean categories Boolean circuit Boolean circuits Boolean circuits of depth two Boolean closure Boolean closure of context-free languages Boolean closure of deterministic Boolean closure of deterministic classes of automata Boolean closure of deterministic context-free languages Boolean closure of NP Boolean combinations of queries Boolean completion Boolean computation Boolean computations Boolean connectives Boolean constraints Boolean convolution Boolean dimension Boolean expression Boolean expressions Boolean formula Boolean formulas Boolean function Boolean function approximation Boolean function of the states Boolean function on disjoint sets Boolean functions Boolean functions monotone Boolean functions Boolean functions network complexity of Boolean functions Boolean functions norm for Boolean functions Boolean functions representable Boolean functions Boolean functions representation of Boolean functions Boolean functions with low L1 norms Boolean graphs Boolean hierarchy Boolean Horn formulae Boolean l×l-matrices Boolean languages Boolean lattices Boolean linear operators Boolean machine models Boolean matrices Boolean matrix Boolean matrix functions Boolean matrix multiplication time Boolean matrix product Boolean network Boolean networks Boolean neural nets Boolean operations Boolean operators Boolean operators on ω-languages Boolean permanent Boolean processing component Boolean programs Boolean queries Boolean query languages Boolean query languages over finite structures Boolean relations Boolean routing schemes Boolean satisfiability problem Boolean semiring Boolean set operations Boolean sorting Boolean sums Boolean threshold computations Boolean two-person game Boolean two-person games Boolean variables Booleans Booleans Boolean-valued functions Boolean-variable Boolean-weighted counting functions Boolos Boolos' example Booth Booth and Lueker Boppana Boppana border border rank of a tensor border rank of tensors Borel Borel Borel and Laubie theorem Borel class Borel classes Borel hierarchy Borel normal numbers Borkowski Borkowski-Slupecki's Borkowski-Slupecki's device Borkowski-Slupecki's rule Borodin Borodin et al. borrowing of logical structure Bossi Bossi and Menegus bottom bottom fan-in bottom morphism bottom planes of three-dimensional arrays bottom-up bottom-up abstract interpretation bottom-up abstract interpretation of logic programs bottom-up algorithm bottom-up algorithms bottom-up approach bottom-up automata bottom-up computation bottom-up evaluation bottom-up finite-state tree transducer bottom-up generalization procedure bottom-up generalized automata bottom-up method bottom-up operational procedure bottom-up parsing bottom-up transduction on term representations bottom-up tree bottom-up tree pushdown bottom-up tree pushdown automata bottom-up tree transducers bottom-up tree transformations BOTTOM-UP-HEAPSORT Boudol bound bound bound fixed bound bound linear lower bound bound matching lower bound bound optimal lower bound bound primitive recursive bound bound randomized upper bound bound uniform linear upper bound bound upper bound bound variables boundaries boundaries boundary boundary between decidable and undecidable boundary eNCE boundary eNCE graph boundary eNCE graph grammars boundary eNCE graph language boundary of a boundary of a concept boundary of a picture bounded bounded bounded 2-sided error bounded alternating bounded alternating on-line Turing machines bounded alternating Turing machines bounded ambiguity bounded ATMs bounded automata bounded balance bounded Borel bounded Borel measures bounded capacity priority queues bounded complete bounded complete ω-algebraic cpo's bounded complete domains bounded complexity bounded complexity cut rule bounded context-free languages bounded D0L languages bounded database schemes bounded deciphering delay bounded degree bounded degree source graph bounded degree trees bounded delay bounded delay L codes bounded delay morphisms bounded dependencies bounded discrete values bounded disorder bounded disorder file organization bounded domain bounded equality-generating dependencies bounded error bounded error probability bounded existential types bounded existentials bounded fan-out bounded fan-out circuits bounded first-order quantification bounded fixpoint operator bounded fixpoints bounded free choice bounded free choice nets bounded free choice system bounded full implicational dependencies bounded gap Ramsey-type property bounded genus bounded grammar families bounded height bounded in storage bounded incremental algorithm bounded inequivalence aprobelms for expressions bounded inequivalence problem for arithmetic bounded interpretations of grammar forms bounded intuitionistic proof system bounded language bounded language families bounded languages bounded linear logic bounded memory bounded nondeterminism bounded nondeterministic choice operator bounded NP query hierarchies bounded number bounded number of iterations bounded objective functions bounded orientation bounded parallelism bounded Petri net bounded product bounded programs bounded quantification bounded quantifier alternation depth bounded quantifiers bounded queries bounded queries to SAT bounded query bounded query machines bounded query reductions bounded real valued function bounded real-valued function bounded real-valued functions bounded recursion bounded rewriting systems bounded second-order λ abstraction bounded semilinear language bounded sets bounded stack registers bounded suffix bounded summation bounded time bounded tree-width graphs bounded truth table bounded two-dimensional ATMs bounded widths bounded work registers boundedness boundedness boundedness for Petri nets boundedness lemma boundedness of boundedness of database schemes boundedness of sequences boundedness problem boundedness problem on graphs boundedness problems for boundedness problems for vector addition systems bounded-complete bounded-complete algebraic cpo bounded-complete cpo bounded-complete domains bounded-complete hull bounded-complete hull of an a-space bounded-degree bounded-degree decision tree bounded-degree networks bounded-depth circuits bounded-error probabilistic machines bounded-query bounded-right-context grammars bounded-width bounded-width branching bounded-width branching programs bounding bounding its proof-theoretic strength bounds bounds bounds for bounds for equivalence of Presburger formulas bounds for linear queries bounds for maximal flows bounds for minimal comparison merging bounds on bounds on composition of functions bounds on depth of nesting of function calls bounds on inputs bounds on nonholonomy bounds on the number of productions in a grammar boustrophedonic boustrophedonic boustrophedonic algorithms boustrophedonic automata Bouton Bouton Bovet Bovet et al. Bowen Bowen box calculus boxes Boyce Boyce-Codd normal form Boyce-Codd normal form database schemes Boyce-Codd normal form families Boyer Boyer-Moore Boyer-Moore algorithm Boyer-Moore automaton Boyer-Moore character comparison order Boyer-Moore-Horspool algorithm Boyer-Moore-type string searching algorithms BP BP (bipolar) synchronization scheme BPA BPA BPA axiom system BPA plus state operator BPP BPP BPP-nets Bru¨ggemann-Klein bracket bracket bracket abstraction bracket context-free languages bracket languages bracketed bracketed context free languages bracketed context-free languages bracketing bracketing property brackets brackets braid braid groups branch and bound branches branching branching algorithm branching automata branching bisimilarity branching bisimulation branching event structures branching flow graph branching in branching in discrete processes branching instructions in programs branching nodes branching nondeterministic infinite automata branching points branching program branching program depth branching program operator branching program with linear queries branching programs branching programs computing Boolean functions branching programs of branching programs of bounded widths branching programs of unbounded widths branching programs with linear queries branching search space branching structure branching structure of terms branching term rewriting systems branching time branching time models branching time semantics branching time semantics for recursion with merge branching time temporal logic branching transition branching transition relation branching transition systems branching-time branching-time combinators branching-time framework branching-time operators branching-time temporal logics branching-time v Brand Brand and Zafiropulo Brandenburg Brandenburg brave reasoning Brazma Brazma and Kinber BRC BRC (bounded right context) grammar BRC grammar BRC property breadth breadth first search algorithm breadth-first breadth-first context-free breadth-first context-free grammars breadth-first grammars breadth-first rewriting breadth-first search breadth-first search rule breakdown breakdown rates breakdowns breakdowns Breidbart Breidbart Breitbart Breitbart Brent Brent Brent and Kung's adder Brent Kung adder Brent's Brent's theorem Brent-Kung algorithm Bresenham Bresenham's discrete lines brick language bridges Briley Briley broadcast broadcast broadcast calculus broadcast communication broadcast encryption broadcast message broadcast network broadcast problem broadcasted broadcasted signals broadcasting broadcasting Brock Brock and Ackerman Brock and Ackerman anomalies Brock and Ackerman model of nondeterministic asynchronous processes Brocot Broder Broder Bronstein Bronstein Brookes Brookes Brookes and Rounds Brooks Brooks' theorem brother trees Brouwer Brouwer's Brouwer's Brouwer's fixed points Brouwer's intuitionism Brouwer's theory of choice sequences Brouwerian Brownian Brownian Brownian excursion functionals Brownian motion Brozowski Brozowski's Brozowski's result on star free languages Bruck Bruck and Smolensky Brüggemann Bruhat Bruijn Bruno Bruno's Bruno's formula Bruschi Bruschi et al. Bruss Bruss and Meyer brute-force search jobs Brzozowski Brzozowski Brzozowski and Knast theorem Brzozowski derivatives Brzozowski hierarchy Brzozowski hierarchy of ω-languages Brzozowski hierarchy of languages Brzozowski's algorithm for constructing DFA's BSP BSP BSP programming BSPRAM BSPRAM BSPRAM algorithms BSS BSS model BSTA BT BT (branching time) semantics btt bubbling system Buchberger Buchberger Buchberger algorithm Buchberger theory Buchberger's algorithm Buchberger's family of languages Bucher Bucher Bucher and Culik Bucher, Culik II, Maurer and Wotschke Büchi Büchi's bucket bucket bucket recursive trees bucket size budget budget constraint buffer buffer buffers buffers building building blocks building blocks of building blocks of artificial neural networks building blocks of distributed applications building blocks of operators building blocks of parallel applications building calculi building descriptions building libraries building of complex modules from simpler ones building strategies built-ins bulk bulk data bulk updates bulk-synchronous model bulk-synchronous parallel bulk-synchronous parallel computation bulk-synchronous parallel random access machine Bunder Bunder and Meyer Buneman Buneman's Buneman's lossless power domains Burge Burge's Burge's mapstream function Burks Burks et al. burner burner flame Burnside Burnside problem Burroni Burroni Burstall Burstall Burstall and Pnueli Burstall Manna and Waldinger intermittent assertion method Burstall's Burstall's intermittent assertions method Bushi Bushi Buss Buss busses butterfly butterfly butterfly dag computation butterfly network by parallel computers of Boolean functions Byzantine Byzantine Byzantine faulty behavior Byzantine processes B-LAG's B-rational identities B-splines B-tree index C = P C programs cβ normal form cβ-machine cβ-reduction cβ-reduction in combinatory logic c.f. grammar c.f. grammars C/E systems C/E systems, augmented ~ C1-LAGs ~parsers C2-LAGs C3-LAGs C5 cycle in a graph Ce´sari Ce´sari-Schu¨tzenberger algorithm CA CA cellular array CA's CA's CABP CABP cache cache size CACI cacti cacti CAD CAD tools Cahndy Cai Cai calculability calculability calculability issues calculation calculation capacities calculation capacities of Lambda-calculus calculational calculational proofs calculators calculi calculi calculi of concurrent processes calculi of control calculus calculus calculus for distributed computation calculus for nondeterministic flowchart schemes calculus for synchrony calculus for three valued logic calculus for three valued logic interpretations of one calculus in another calculus of calculus of broadcasting systems calculus of closures calculus of communicating systems calculus of concurrent processes calculus of constructions calculus of coordinating environments calculus of decomposition calculus of design calculus of finite differences calculus of fixed point terms calculus of generalized natural transformations calculus of invariants calculus of Lukasiewicz calculus of mobile processes calculus of natural transformations calculus of nets calculus of partially-ordered data type structures calculus of polynomials calculus of processes calculus of program refinement calculus of stochastic systems calculus of substitutions calculus of S-invariants for PrT nets calculus of total correctness calculus with typical ambiguity call by name call by name λ-calculus call by name evaluation call by name interpretation call by name languages call by name mechanisms call by name strategy call by name variant of ISWIN call by value call by value confluent systems call by value interpretation call by value operational semantics call by value semantics calling patterns for a clause calling patterns of clauses calling structure call-by-name call-by-name λ-calculus call-by-name evaluation call-by-name interpretation call-by-name languages call-by-name mechanisms call-by-name strategy call-by-name variant of ISWIM call-by-name variant of ISWIN call-by-value call-by-value confluent systems call-by-value interpretation call-by-value operational semantics call-by-value semantics call-consistency condition call-consistent program Γ calulating CAM CAM CAMILA CAMILA, specification and prototyping language CAML Campbell Campbell-Haussdorf formula cancellation cancellation cancellation conditions cancellation groups cancellation of substrings cancellation operation on strings cancellation properties in context-free grammars cancellations cancellative cancellative cancellative automaton cancellative semigroups Canny Canny et al. canonical canonical canonical amalgamation construction canonical bit recoding technique canonical completion of a poset canonical congruence canonical congruence induced by the concurrency relations canonical constraints canonical constraints for parametrized data types canonical decomposition canonical derivation forms canonical equational theory canonical expression canonical extensions of languages canonical finite presentations canonical form canonical form for canonical form for constraint specifications canonical form for decision trees canonical form of a canonical form of a circular string canonical form of a polynomial matrix canonical form of matrices canonical form of rewrites canonical forms canonical forms for interval functions canonical function canonical function application canonical function computation canonical generator sets canonical interpretation canonical models canonical models of map theory canonical numbering canonical one to-one correspondence canonical one-to-one correspondence canonical positions canonical PP-complete set canonical process canonical q-series canonical recoding canonical representation canonical representation of planar graphs canonical representations of proofs canonical representative canonical representative of equivalence classes canonical representatives of equivalence classes canonical representatives of functions canonical rewrite system canonical slice functions canonical solution canonical string-rewriting systems canonical structure of an Abelian group canonical system canonical systems canonical term algebras canonical type canonical types for grammar forms canonical types for grammars Cantor Cantor discontinuum Cantor topology Cantor's Cantor's space Cantor-Zassenhaus factorization algorithm capabilities capabilities capabilities for reasoning capabilities of hybrid dynamical systems capabilities of inference capabilities to execute jumps capability capability to execute jumps capacities capacity capacity-oriented availability capturing capturing complexity classes capturing strong reduction Cardelli Cardelli and Wegner's kernel fun variant of system F&le cardinal cardinalities cardinalities cardinalities of relations cardinality cardinality cardinality bound cardinality of a cardinality of a combinatory basis cardinality of a finite semigroup of matrices cardinality of a group cardinality of a semigroup of matrices cardinality-bounded set values Carlo Carlson Carlson carrier carrier carrier sets carriers carriers of an algebra Cartan Cartan subalgebra Carter Carter-Wegman universal hashing Cartesian Cartesian Cartesian closed Cartesian closed categories Cartesian closed categories of Cartesian closed categories of algebraic cpo's Cartesian closed categories of domains Cartesian closed category Cartesian closed category of algorithms Cartesian closed category of domains Cartesian closed full subcategories Cartesian coordinate system Cartesian plane Cartesian product Cartesian product of component alphabets Cartesian-closed categories Cartesian-closed category of domains Cartesian-closedness Cartier Cartier and Foata Cartmell Cartmell cascade cascade cascade composition cascade decompositions cascade product Case Case and Smith case bases case intrinsic properties Caseau Caseau case-based case-based learnability case-based learning case-based reasoning case-based representation case-based representations Castellani Castellani Castellani's abstraction homomorphisms Catalan Catalan number Catalan's Catalan's equation Catalan's equation number catamorphisms catamorphisms catch rules categorial categorial categorial axiomatizations categorial construction categorial grammar categorial grammars categorical categorical categorical abstract categorical abstract machine categorical adequacy result categorical approaches categorical aspects of data type constructors categorical axiomatizations of arithmetic categorical combinator categorical combinator reduction system categorical combinator terms categorical combinators categorical combinatory logic categorical constructions categorical constructs categorical equivalence categorical fixed point categorical fixed point semantics categorical framework categorical framework for program semantics categorical generalization of domains categorical grammar categorical graph grammars categorical graph-grammar approach categorical graph-oriented object data model categorical implementation of term rewriting categorical interpretation of pre- and post-condidtions categorical model categorical models categorical notation categorical programming categorical programming language categorical programming language implementation categorical properties categorical rewriting categorical role of the natural numbers categorical semantics categorical structures categorical structures in nonextensional lambda calculus categorical systems categorical universe categorical viewpoint categories categories categories in semigroup theory categories in semigroup theory linked by adjoint functors categories of categories of algebras categories of algebras for special monads categories of algebras of partial types categories of domains categories of embeddings categories of interpretations categories of monads categories of partial orders categories of partialmorphisms categories of predicate categories of predicate transformers categories of quasi-prime algebraic domains categories of transition systems category category category class category classes category in abstract complexity theory category models category of category of ω-cpo's category of 1-bounded compact ultrametric spaces category of actions category of algebraic cpo's category of algebraic lattices category of algebras category of bases category of closed homomorphisms of unary partial algebras category of coherent spaces category of compact metric spaces category of complete category of complete lattices category of complete partial orders category of concatenable processes category of continuous category of continuous domains category of continuous lattices category of countably based algebraic cpo's category of descriptive modal frames with contractions category of digital spaces category of directed category of directed complete partial orders category of directed graphs category of dI-domains category of domains category of finite sets category of flowcharts category of flow-charts category of graphs category of homomorphisms of unary partial algebras category of infinite directed hyperedge-labelled hypergraphs category of information systems category of modal algebras with homomorphisms category of models of computation category of modest sets category of modular development category of observation frames category of occurrence nets category of partial algebras category of partialmorphisms category of process models category of profinite domains category of Scott continuous lattices category of Scott domains category of semimodules category of sets category of sets generated by Martin-Lo¨f's extensional type theory category of sets in time category of symmetries category of T0 topological spaces category of transition systems category of trees category Pos(ω) category theory category theory in computer science category theory of binary relations categoryPos(ω) category-sorted category-sorted action semantics category-sorted algebra category-sorted algebra-based action semantics category-theoretic category-theoretic characterization of functional completeness category-theoretic results category-theoretic structures catenation catenation catenation operation catenative catenative L catenative L scheme catenative L systems catenativity catgory Cauchy Cauchy Cauchy completion Cauchy integrals Cauchy matrices Cauchy products Cauchy sequence Cauchy sequence representation Cauchy sequences Cauchy towers of spaces causal causal causal automata causal behaviour causal dependencies causal functionals causal net causal nets causal partial orders causal structure causal structure of a deterministic concurrent system causal trees causality causality causality ordering causality relation cautious cautious cut cautious monotony cautious reasoning Cavedon Cavedon Cayley Cayley Cayley automata Cayley automata with pebbles Cayley graph languages Cayley graphs Cayley trees Cayley-Hamilton identity Cazanescu Cazanescu and Stefanescu Cazanescu and Ungureanu cbnormal CBS CBS CBS congruences CCω CCC CCC ccc CCC models CCC's CCE CCL CCL CCLβ CCLβ rewriting system CCLβ SP CCLβη SP CCLb CCLbh CCP CCP CCP incremental algorithm CCP incremental family of languages CCP system CCP systems with deep guards CCS CCS CCS agent CCS agents CCS bisimulation CCS calculus of communicating systems CCS context CCS expressions CCS operation CCS process calculus CCS processes CCS semantics CCS terms CCS transition CCS-like languages CD CDF CDF CDF-series cdr CDS CDS's CE CE agents Cech Cech closure spaces cedar cedar trees Cederbaum cell cell cell action structure cell complex cell decomposition cell form cell lineages cell of an ITA cell probe complexity cell probe complexity bounds cells cells cells in a biological system cellular cellular cellular array models cellular arrays cellular automata cellular automata computations cellular automata limit sets cellular automata probability functions cellular automata synchronizers cellular automaton cellular automaton model cellular Bu¨chi automata cellular code cellular interactions cellular space center center center of a language center of languages center switches centers centers of languages center-mapping of languages central central slice functions centralized centralized centralized PC grammar centralized program centralized system centre Cerro certificates certificates of primality certification certification method certified certified group actions Cesari Cesari Vincent theorem CF cf cf grammars CFARb CFG CFG cfg CFL CFL CFL cfl CFL's CFSM CFSM CF-ambiguous CF-languages CGPP CGPP chain chain chain automata chain closed under chain property chain code picture chain code picture language chain code picture languages chain code pictures chain complete posets chain complete posets and isotone maps chain completeness chain completion chain completion of a poset chain decomposition chain grammars chain languages chain of chain of iterations chain of retractions chain partitions of orders chain properties chain rule free cfg chain rules chain rules in context free grammars chain rules in context-free grammars chain transitive chaining chains chains of chains of derivations chains of full AFL's chains-*continuous maps chain-code picture language chain-complete chain-complete partially ordered sets chain-complete posets chain-complete subsets chain-completeness of partially ordered sets chain-completion chain-continuous maps chain-free context free grammar chain-free context-free grammar chain-inductive Chaitin Chaitin chance leads Chandra Chandra Chandra et al. Chandra, Kozen and Stockmeyer Chandy Chandy Chandy and Misra Chang Chang Chang and Paige change change of state changeable input size changes-of-states change-making problem changing changing semantics changing the base of a number system Chang-Roberts distributed election algorithm Chang-Roberts distributed election theorem channel channel channels channel-label expressions chaos chaos chaotic chaotic chaotic behavior chaotic characteristics chaotic dynamical chaotic dynamical behaviours chaotic dynamical system chaotic fixed point theorem chaotic iterations chaotic numerical perturbations Char Char et al. character character comparison order character substitutions characterisation characterisation characterisation of characterisation of deterministic context-free languages characterisation of the four-colour problem characterisations characterisations of impartial sequences characteristic characteristic 0 characteristic algebra characteristic arrays characteristic class characteristic classes characteristic functions characteristic of characteristic of fields characteristic of pavings characteristic parameters of binary search trees characteristic polynomial characteristic polynomial of a matrix characteristic properties of subwords characteristic rules characteristic sets characteristic sets of differential ideals characteristic words characteristic zero characteristic zero fields characteristics characteristics characteristics for probabilistic databases characteristic-two finite fields characterizable characterizable complexity classes characterization characterization characterization Angluin characterization of learnable families characterization for characterization for bounded context-free languages characterization for computations in BPP-nets characterization for multi-pattern languages characterization for rational ω-languages characterization for the complexity of linear program ming characterization Kleene characterization of recognizable subsets characterization logical characterization characterization of characterization of λ definability characterization of ω-chain complete partially ordered sets characterization of Ω-languages accepted by X-automata characterization of ω-regular languages characterization of ω-regular languages by first-order formulas characterization of (E0L-E0L) array languages characterization of accessible prefix transitive graphs characterization of AFP's characterization of algebraic specification characterization of algebraic specification languages characterization of an interaction-free MVD set characterization of ANC AG's characterization of aperiodic semigroups characterization of baseline-equivalent multistage interconnection networks characterization of behavioral reduction characterization of behavioural characterization of behavioural abstraction characterization of behavioural satisfaction characterization of bisimulation equivalence characterization of brother trees characterization of classes of characterization of classes of regular events characterization of completion characterization of complexity classes characterization of computable real-valued characterization of computable real-valued functions characterization of computable real-valued relations characterization of computing domains characterization of context-free generators characterization of context-free languages characterization of DCFL's characterization of DCFL's characterization of deductive databases characterization of digital search trees characterization of distributively computable functions characterization of domains characterization of dynamic behaviour characterization of D-structuredness characterization of embeddability characterization of exponential time languages characterization of expressiveness characterization of families of languages characterization of finite characterization of finite monoids characterization of finite monoids possessing a universal presentation characterization of finite Sturmian words characterization of Floyd-Hoare logic characterization of frontier testable tree languages characterization of grammars characterization of graph languages characterization of graphically representable formulae characterization of group codes characterization of homogeneously orderable graphs characterization of Horn functions characterization of if-then-else characterization of inference bases characterization of infinite characterization of infinite behavior characterization of infinite fair computations characterization of interconnection networks characterization of interior and exterior points characterization of invertible terms characterization of join dependencies characterization of L systems characterization of L(BSTA) characterization of languages characterization of LC(0) languages characterization of linear ω-languages characterization of linear indexed languages characterization of LL languages characterization of LL(k) grammars characterization of LLP(k) grammars characterization of machines of type U1(M)~ characterization of macro tree transducers characterization of migration inventories characterization of minimal characterization of minimal complete sets of words of a free monoid which are codes characterization of minimal firing time characterization of morphisms characterization of morphisms which preserve finite and infinite standard Sturmian words characterization of morphisms with Sturmian stationary words characterization of multivalued dependencies characterization of M-automata characterization of name-stamp protocols characterization of non-erasing pure context-free derivation relations characterization of normal forms characterization of NP characterization of NPOP's characterization of observation equivalence characterization of observational equivalence characterization of one-counter groups characterization of passing compatibility characterization of permutation groups characterization of Petri net languages characterization of PHCF characterization of Plotkin's order characterization of polynomial time characterization of positive rational sequences characterization of Post simple sets characterization of power-free morphisms characterization of prefixes of behaviors characterization of PSPACE/poly characterization of pushdown permuters characterization of queue languages characterization of rational Ω-languages characterization of rational functions characterization of rational functions of bounded complexity characterization of rational relations characterization of rationality of zigzag series characterization of recognizable languages characterization of reducible flowchart schemes characterization of regular ω-languages characterization of reversal bounded multipushdown machine languages characterization of reversal-bounded multipushdown machine languages characterization of reversible celluar automata characterization of secure two-party cascade protocols characterization of semi-AFP's characterization of sequences of numbers characterization of sequential functions characterization of small cancellation groups characterization of stage graphs characterization of star-free languages characterization of state-independent automata characterization of strongly liberal algebraic institutions characterization of Sturmian morphisms characterization of subsequential functions characterization of symbolic sequences characterization of the characterization of the 2-bounded languages recogized by 1-DPDA's characterization of the classes of recognizable Boolean languages characterization of the complexity of the subgraph isomorphism problem on bounded tree-width graphs characterization of the deductive strength of surface deduction characterization of the double-pushout transformation characterization of the EXRUD class of languages characterization of the information ordering on environments characterization of the intermittent assertions method characterization of the largest bisimulation characterization of the natural numbers characterization of the optimal arrangement of records characterization of the polynomial-time hierarchy by classes of Presburger formulas characterization of the Rabin index of an ω-language characterization of the Scott topology characterization of the search number characterization of the semantics of Occam characterization of the squares in a Fibonacci string characterization of the star-height of a prefix-free regular language characterization of thinning characterization of transductors characterization of uniformly nonprimitive labeled 2-structures characterization of unispectral morphisms characterization of well branching event structures characterization of wellfounded while computation trees characterization results for characterization results for D0L systems characterization results for partial algebras characterization theorem for context-free generators characterization theorems characterization theorems for characterization theorems for higher type characterization theorems for higher type equational classes characterization theorems for higher type Horn classes characterization theorems for nonsymmetric cascade protocols characterization theorems for symmetric cascade protocols characterizations characterizations characterizations of characterizations of π-calculus bisimulation equivalences characterizations of cellular arrays characterizations of complexity classes characterizations of context-free languages characterizations of families of languages characterizations of finite semilattices characterizations of infinite tree languages characterizations of iterative arrays characterizations of language families characterizations of LLP(k) grammars characterizations of partial recursive sequence functions characterizations of primitive recursive wordsequence functions characterizations of program characterizations of program verification systems characterizations of rational ω-languages characterizations of rational adherences characterizations of recognizable picture languages characterizations of recursively enumerable languages characterizations of regular languages characterizations of repeatable characterizations of repeatable languages characterizations of repeatable words characterizations of sets of numbers recognizable by a finite automaton characterizations of structured flowchart schemes characterizations of theclass PSPACE/poly characterizations of transition system equivalences characterizing characterizing characterizing ω-regular languages characterizing a bilattice characterizing approximation classes characterizing asynchronous processes characterizing boundedness of database schemes characterizing classes of languages by machine models characterizing complete programs characterizing complexity classes characterizing D0L languages characterizing fault tolerance characterizing finite Kripke structures characterizing learnable concept classes characterizing pattern spectra characterizing slices characterizing stable functions characterizing structure languages characters characters charity charity programming system charity programming system framework chart chart parsers charts Chase chase Chase's Chase's algorithm for pattern preprocessing Chaudhuri Chaudhuri Chazelle Chazelle cheatable cheatable sets cheating checker checkers checking checking equivalence checking liveness checking nontermination checking set disjointness checking stability checking stacks chemical chemical chemical abstract machine chemical metaphor chemical solutions Chen Chen Chern Chern characters Chernoff Chernoff bounds Chernovenkis Chervonenkis Chervonenkis and Vapnik chess chess chessboard chip chip chip configurations chip firing games chip firing games on graphs chip games chip transfer games chip-firing game chip-firing game on undirected graphs Choffrut Choffrut Choffrut and Choffrut and Culik II Choffrut and Schu¨tzenberger choice choice composition choice of consequence relation choice of programming system choice operation choice operator choice operators choice sequences choices choices of finite state control automata Chomsky Chomsky Chomsky and Stanley characterization of context-free languages Chomsky and Stanley homomorphic characterization of context-free languages Chomsky and Stanley's homomorphic characterization of context-free languages Chomsky classes of languages Chomsky hierarchy Chomsky hierarchy of adherences Chomsky normal form Chomsky normal form for context-free string grammars Chomsky normal form grammar Chor chord chordal chordal chordal bipartite graphs chordal graph chordal graphs chordless chordless chordless cycle chordless path Chottin Chottin Choueka Choueka Choueka automata Christoffel Christoffel Christoffel pairs Christoffel primitive words Christoffel tree Christoffel word Christofides Christofides algorithm Christofides family of languages Christol Christol et al. chromatic chromatic index chromatic number chromatic number problem chrono chrono-topology Chu Chu construction Church Church Church numerals Church's Church's simply typed λ-calculus Church's simply-typed λ-calculus Church's thesis Church-numerals Church-Rosser Church-Rosser approach Church-Rosser approach to correctness of Church-Rosser approach to correctness of asynchronous parallel programs Church-Rosser approach to correctness of parallel programs Church-Rosser confluence property Church-Rosser congruence Church-Rosser monadic reduction systems Church-Rosser monoids Church-Rosser properties Church-Rosser property Church-Rosser property for ground term-rewriting systems Church-Rosser property of Thue systems Church-Rosser relation Church-Rosser strategies in the lambda calculus Church-Rosser strategy Church-Rosser subcalculus Church-Rosser system Church-Rosser theorem Church-Rosser theorem for graph derivations Church-Rosser Thue system Church-Rosser Thue systems Church-Rosser tree replacement systems Ciancaglini cicuit complexity cicuit complexity classes cicuit complexity lower bounds cigarette cigarette smokers problem circle circle intersections circles circuit circuit circuit behaviour circuit characterization circuit characterization of alternating Turing machines circuit characterizations circuit communication complexity circuit complexity circuit complexity lower bounds circuit depth circuit design circuit designs circuit families circuit graph search problems circuit lower bounds circuit size circuit size relative circuit sizes circuit switching environment circuit value problem circuits circuits circuits over a complete bases circuits over lattices circuits over lattices circuits vs. algorithms circuit-size complexity circuit-size complexity bounds circuit-switching connections circulant circulant MBD circulant mbd circular circular circular bindings circular bindings in programs circular bindings of variables circular codes circular convolution circular data circular data type specification circular data types circular extrema-finding problem circular local codes circular permutation circular string circularity circularity of variable types circumscribing circumscribing DATALOG circumscription circumscription circumscription of a propositional formula CL CL claim clairvoyant clairvoyant scheduling clan clan clan decomposition theorem of Ehrenfeucht and Rozenberg clan in a 2-structure clans clans clans in 2-structures Clark Clark completion Clark's Clark's Clark's completed data bases semantics Clark's completion Clarke Clarke class class comprising conservative learning class equivalence problem class Genε class inclusion problem class membership class membership decision problems class NC class of class of algebras class of algorithms EP class of cts systems class of domains class of dynamic constraints class of functions of uniform complexity class of graph languages generated by separated grammars class of languages class of languages accepted by nondeterministic logspace-bounded Turing machines class of languages generated by HG's class of NP operators class of recursively enumerable languages class of reducibilities class of sets accepted by log-space-bounded deterministic TM's class of sets accepted by polynomial-time-bounded nondeterministic TM's class of sets accepted in polynomial time class of sets computable by deterministic polynomial time algorithms class of spectra class of submonoids generated by an infinitary code class of unrestricted regular expressions class preserving class preserving hypothesis space class preserving learning class specification classes classes Hk classes of classes of λ models classes of λ-schemes classes of ω languages classes of concurrent languages classes of derivation relations classes of edge labelled graphs classes of Petri nets classes of queries classes of recognizable languages classes of regular events classes of super-nonsingular DPDA's classes of tractable unrestricted regular expressions classes of type-free λ schemes classes opt-L classic Dushnik-Miller dimension classic pumping classic pumping condition classic pumping lemma classical classical abstract data type classical abstract data type theory classical algebraic domains classical algorithmic problems in free groups classical automata classical automata theory classical Burnside problem classical class classical classes classical combinatorial structures classical computational models classical consequence relation classical context free languages classical context-free languages classical cryptosystems classical digital computation classical families of codes classical first order theory classical first-order classical first-order predicate calculus classical first-order theory classical functionality theory of Curry classical Galois theory classical hierarchy classical inference classical Lambda-calculus classical limited register machines classical linear classical linear first-order predicate classical linear logic classical linear predicate logic classical logic classical logics classical mathematics classical minimal deterministic automaton classical models classical multiplicative logic classical natural deduction systems classical optimization problems on graphs classical order-sorted logic classical paperfolding sequences classical parallelization techniques classical partial orders classical primitives classical proof rules classical propositional logic classical recursion theory classical recursive classical recursive function theory classical recursive functions classical recursive operators classical resolution classical schematological theorems classical second-order systems classical set-functions classical sorting problem classical stochastic scheduling classical structures classical systems of expressions classical theorems classical theory of Turing machines classical tiling problems classical topological invariants classical unification algorithm classification classification and reconstruction of flowcharts classification of classification of ω-regular languages classification of complexity core lattices classification of concurrency models classification of degenerate behavior classification of deterministic classification of deterministic Lindenmayer systems classification of deterministic root-to-frontier tree transformation classes classification of dynamic programming problems classification of embedding mechanisms classification of finite monoids classification of flow graphs classification of functional programs classification of Muller automata classification of multi-set orderings classification of NP-complete languages classification of NP-complete optimization problems classification of p.r. functions classification of polynomial multiplication algorithms classification of real-time constructed sequences classification of short normal forms for E0L systems classification of slender 0L languages classification of temporal properties classification of the classification of the complexity of operators classification of the generalized equality sets classification of the long-βη-normal forms classification of tree languages classification problems classifications classifications of classifications of # switching networks classifications of bottom-up tree pushdown automata classifications of coefficient subsets for exact BKK bound classifications of elementary CA's classifications of genus-1 rooted maps classifications of parallel complexity class classifications of set operations classifier classifiers classifying classifying languages classifying NP-complete languages classifying NP-complete optimization problems class-dependent service rates clausal clausal form clausal superposition clause clause clause declarations clause implication clause instantiation patterns clause programs clause unfolding Clausen Clausen and Fortenbacher clauses clauses clauses in logic programs clauses of a Boolean function clauses with at most two literals clean operational semantics CLEAR, language Cleaveland Cleaveland CLH CLH clients Clifford Clifford's Clifford's theorem clique clique clique function clique graph clique problem clique problem for graphs clique problem on graphs cliques cliques clique-polynomial CLL CLL clock clock clock calculus clock common clock for different locations clock construction in full asynchronous parallel systems clock cycles clocks clocks clocks in dataflow languages clopen clopen sets Clos Clos network closed closed λ-K-terms closed λ-terms closed algebraic theory closed comprehension categories closed continuously directed subsets closed curve closed curves closed curves cyclic network closed cyclic network closed fields closed fixed point term closed form closed form analysis of worst case bounds closed formulas closed homomorphisms of unary partial algebras closed iterative calculus closed monomorphisms closed normal form closed quantified literals closed queueing network closed queueing network with multiple job classes closed semiAFL closed semirings closed semi-rings closed set closed sets closed sets of closed sets of attributes closed sets of words closed subset closed subsets closed term model of # closed terms closed terms in the typed λ-calculus closed terms sublanguage of closed terms closed terms without recursion closed under closed under ω-tranductions closed under chain property closed under complementation closed under complements closed under composition closed under concatenation closed under exponentiation closed under finite variation closed under homomorphic equality closed under homomorphisms closed under intersection closed under inverse closed under inverse homomorphic equality closed under inverse homomorphism closed under inverse morphisms closed under left concatenation by languages closed under minor taking closed under nonerasing homomorphic equality closed under polynomial-time positive-bounded-truth-table reductions closed under quotients closed under reversal closed under semi-direct products closed under the fixed-point operation closed under the restriction operation closed universal Horn formulae closed universal Horn formulae in prenex normal form closed world closed world assumption closed world assumptions closedness closedness under Boolean operations closedness under Boolean operations extended closedness under concatenation closed-form evaluation closed-form evaluation expressions closed-form solvability closed-world reasoning closed-world reasoning extended closest closest zero property closure closure closure algorithms closure assumption closure conditions closure functions closure of closure of #P closure of a closure of a class of languages closure of a language closure of an element closure of Boolean automata closure of deterministic context-free languages closure of group languages closure of languages closure of matrices closure of matrices over closed semi-rings closure of NP closure of the class of finite languages closure of the family of closure of the family of finite languages closure of the family of languages generated by M-automata and B-automata closure of the family of PD1L languages closure of the shuffle operator closure operations closure operations for elements closure operator closure properties closure properties for closure properties for FAMs closure properties for stochastic forests closure properties for stochatic languages closure properties of closure properties of ASPMHFA's closure properties of BCF languages closure properties of cellular arrays closure properties of families of languages closure properties of generalized parenthesis languages closure properties of k-regular sequences closure properties of language families closure properties of linear ω-languages closure properties of LR(0) languages closure properties of MCFL's closure properties of nest sets closure properties of NLC languages closure properties of one-way multihead automata closure properties of recognizable trace languages closure properties of regular tree languages closure properties of subset languages of Petri nets closure properties of tree transformation classes closure properties of type theories closure properties under literal shuffle closure property closure property with respect to programs closure spaces closure systems closure under closure under ω-sups closure under complementation closure under exception lists closure under iteration closure under iteration of controls closure under letter to letter homomorphisms closure under nonerasing homomorphisms closure under stuttering closure under union closures closures closures in the semantics of programming logic Clote Clote CLP CLP CLP based on relational interval arithmetic CLP language CLP paradigm CLP programs CLP transformation system CLSD cluster cluster points cluster points of finite computations clustered clustered linear processes clustering clustering clustering algorithms clusters clutter clutters clutters CL-term CM CM CM(k), k-counter machine CML CML CML extension of standard ML CMS CMS cms CMS-based semantics cms-based semantics CMS-semantics CN CNF CNF CNF formulas CNF-2 formulas CNF-SAT CNF-SAT problem coalgebra coalgebra coalgebra of all S-labelled trees coalgebras coalgebras coarse grain scheme coarser coarser-grained program coarsest coarsest coarsest congruences coarsest equivalence relation coarsest partition Cobham Cobham Cobham's theorem CoC CoC cocircularity cocircularity Cocke Cocke and Cocke and Allen Cocke and Kennedy Cocke-Kasami-Younger algorithm cocomparability cocomparability graphs cocomplete cocomplete cocomplete categories Codd Codd's Codd's completeness theorem Codd-table code code code alphabet code generation code generation algorithm code optimization code problem for traces code properties code properties of D0L systems code reuse code rewriting rules code selection code selection by inversion of order-sorted derivors code selection problem code selector specification code with finite synchronization delay coded coded coded messages coded systems coded tree codes codes codes associated to finite groups codes for patterns codes generating sofic systems codes of codes of bounded delay codes of paths in a graph codes of trees codes of variable length codes with codes with finite synchronization delay codes with respect to constraints codes with unique splitting codeword codeword codewords codewords code-compatibility code-compatible sets coding coding coding algorithms coding billiard trajectories coding function for finite sequences of positive integers coding into a constrained system of sequences coding of coding of recurrence relations coding of the branches of a tree coding of trees coding sequences coding theory coding tool codings codings codings of codings of a 0L language codings of FP0L languages codings of languages codings of the Pω model coefficient coefficient extraction coefficient ring coefficients coefficients coefficients of the product of polynomials coercions coercions coexistence coexistence coexponent coexponents coexponents cofinal cofinal cofinal reduction systems cofinal reductions cofinal sequence of programs cognitive cognitive theories of Jean Piaget cographs cographs Cohen Cohen-Culik's LRR Cohen-Grossberg model coherence coherence coherence questions coherence spaces coherence theorem coherent coherent coherent computable models coherent dI-domains coherent domains coherent equational term-rewriting systems coherent field coherent prime algebraic consistently complete poset coherent spaces cohesion cohesion cohesion of object histories cohesion operation cohesive cohesive prefix codes cohomology cohomology group coin coin game coinduction coinduction coinduction principle coinductive coinductive datatypes coinductive definitions coinductive definitions of predicates coinductive principles coinfinite coins coins coin-sliding game Cole Cole and virus tests Cole and Vishkin Cole's circuit colimits colimits colimits in colimits in categories colimits in enriched categories collage collage collage grammars collage language collages collages collapse collapse collapse of the polynomial hierarchy collapse results collapsed collapsed terms collapse-free rewrite system collapsing collapsing execution histories Collatz Collatz type functions collecting collecting interpretation collecting semantics collection of binary relations collection of constructors collection of pairwise disjoint polygons collection of parallel jobs collection of strings collection types collections of languages collective collector collectors collinearity collinearity Collins Collins' decomposition collision collision resolution algorithm collision resolution interval colonies colonies color color values colorability colored coloring coloring coloring games colors colors colour colourability colourable coloured coloured coloured graphs coloured nets coloured Petri nets coloured spaces colouring colouring colouring graphs colouring of edges colouring of triangulated graphs colouring pairs of trees colouring problems on dense graphs colouring specifications colourings colours colour-families of graphs column column permutation column-convex polyomino combinable combinaotry combinaotry representation combinaotry term combinaotry terms combinaotry weak reduction combination combination complexity of equivalence combination of combination of bodies of arguments combination of constraint solvers combination of digital and analog circuits combination of evidence combination of probabilistic techniques combination of search combination of tabular formats combination of unbounded demonic choice combination techniques combinational combinational combinational circuits for Boolean functions combinational circuits for computing Boolean functions combinational complexity combinational complexity of combinational complexity of Boolean function combinational complexity of equivalence combinational C-mos circuit designs combinational switching circuits combinations combinations combinations of combinations of chains combinations of convex theories combinations of dependencies combinations of functional dependencies combinations of simultaneous iterative pairs combinations of theories combinator combinator combinator codes combinator equations combinator expression combinator reduction combinator reduction machine combinatorial combinatorial combinatorial algorithms combinatorial analysis combinatorial applications combinatorial arguments combinatorial characteristics combinatorial characterizations combinatorial characterizations of the classes PTAS and FPTAS combinatorial completeness combinatorial complexity combinatorial concrete combinatorial intuitionistic example combinatorial condition combinatorial constructions combinatorial embeddability combinatorial embeddability in infinite graphs combinatorial enumeration methods combinatorial enumeration methods in permutations combinatorial explosion combinatorial extension combinatorial game combinatorial game theory combinatorial games combinatorial geometry combinatorial group theory combinatorial hypermaps combinatorial interpretation combinatorial mathematics combinatorial objects combinatorial optimization combinatorial optimization problem combinatorial optimization problems combinatorial power of subrecursive indexing combinatorial problems combinatorial problems for file organization combinatorial problems in algebra combinatorial problems of information storage and retrieval combinatorial properties of combinatorial properties of approximation preserving reducibilities combinatorial properties of codes combinatorial properties of infinite trees combinatorial properties of infinite words combinatorial properties of meanders combinatorial properties of Sturmian words combinatorial properties of symbolic dynamics combinatorial properties of the free monoid combinatorial representation combinatorial structure combinatorial structure of n-codes combinatorial structure of visibility combinatorial structures combinatorial theory of combinatorial theory of functional expansions combinatorial theory of Mo¨bius functions combinatorial theory of maximal biprefix codes of words combinatorial version of the Riemann hypothesis combinatoric combinatoric combinatoric manifold without boundary combinatoric properties combinatoric properties of the Morse sequence combinatorics combinatorics combinatorics of combinatorics of arrangements combinatorics of Sturmian words combinatorics of the free monoid combinatorics of two word codes combinatorics of words combinatorics on words combinators combinators combinatory combinatory combinatory abstraction combinatory algebras combinatory basis combinatory categorical logic combinatory completeness combinatory differential fields combinatory field combinatory field extensions combinatory logic combinatory logic approach combinatory logic framework combinatory logic with ordered pair combinators combinatory models combinatory PDL combinatory reduction combinatory reduction systems combinatory terms combinatory weak reduction combinator-based abstract machines combinator-code combinatrorial combined complexity combined complexity measure combined solution structure combining combining databases combining given theories combining local controls combining machines into networks combustion combustion comma comma categories comma colimits command command language command lattice commanded direction for robots commit operator commitable commitable commitable language commitable set commitment committed updates common common ancestor problem common base function common belief common clock for different locations COMMON CRCW PRAM common descendant problem common deterministic automata-theoretic techniques common distribution common elements common key common knowledge common language common logspace-complete problems common nature common notational primitive COMMON PRAM common properties common recovery strategies common sense reasoning common storage common subsequence common subtrees common superstring common unbounded queue common zeros common zeros at infinity common zeros of polynomials common-coin communication protocol common-sense common-sense heuristics common-sense reasoning communicate communicating communicating communicating finite communicating finite state machine communicating finite state machines communicating finite-state machines communicating functions communicating grammar systems communicating grammar systems of communicating mathematical software packages communicating processes communicating processes with empty process communicating processes with silent actions communicating processors communicating sequential processes communicating shared resources communicating systems communicating systems calculus of communicating systems communication communication communication and computational requirements in parallel computation communication aspects of networks communication behaviours of CML programs communication channel communication complexity communication complexity for VLSI communication complexity hierarchy communication complexity measures communication complexity of communication complexity of Boolean circuits communication complexity of computing differentiable functions communication complexity of PRAM's communication delays communication disciplines communication graphs communication in CSS communication lines communication links communication networks communication of names communication overhead communication overlap of networks communication path communication primitives communication problem communication properties of networks communication protocol communication protocols communication requirements in parallel ccomputation communication sequences communication structure communication structures communication theory communication with other asynchronous agents communicational communicational complexity communications communications communications between asynchronous agents communications between processes communications protocol transmitting communications protocols communication-time communication-time characteristics communication-time delays communicaton communicaton between adjacent nodes commutation commutation commutation formula commutation law commutation of parameter passing with implementation commutation properties commutation relation commutation rules commutations commutative commutative commutative algebra commutative alphabet commutative and solvable automata commutative border rank of tensors commutative closure commutative diagram commutative DT0L systems commutative equivalent of a prefix code commutative field commutative field of characteristic zero commutative free monoids commutative grammars commutative idempotent monoids commutative identity commutative images commutative images of context free languages commutative images of context-free languages commutative monoids commutative N-rational series commutative ordered ring commutative power commutative power semigroups commutative power series commutative rational expressions commutative regular languages commutative ring commutative rings commutative semigroups commutative semiring families commutative semi-group commutative series commutative unital quantales commutative words commutativity commutativity commutativity of commutativity of a linear language commutativity of operations commutativity requirements commutator commutator commutator in monoids commuting commuting diagram compact compact compact code compact elements compact elements in Scott's reflexive domain in Pomega compact location problems compact metric spaces compact orders compact representations of propositional circumscription compact semi-algebraic set compact set compact set of axioms compact sets compact subset compact T1 spaces compact ultrametric space compact ultrametric spaces compact upper set compact V-continuity space compaction compaction-based parallelization compactly compactly expressible compactness compactness compactness for finitely generated monoids compactness of semantic domains companion companion calculus companion matrices companion tree comparability comparability comparability graphs comparability of words comparable comparative comparative comparative metric semantics for concurrent Prolog comparative schematology comparator comparator gates comparator-circuit value problem comparator-network stability comparing comparing DNA sequences comparing semantic models comparing two rational numbers comparison comparison based problems comparison between words comparison branching programs comparison complexity of merging comparison cost of brother trees comparison merging comparison of CRS's comparison of lower bound methods on communication complexity comparison of programs comparison queries comparison question comparison strategies comparison tree comparison with errors comparisons comparisons between linear functions compass compass and ruler compass and ruler constructions compatibility compatibility compatibility analysis compatibility analysis of interacting automata compatibility for compatibility for parallel processes compatibility for reasoning about extensible environments compatibility of parameter passing compatibility of parameter passing and implementation compatibility of parameter passing with implementation compatibility problems compatible compatible compatible covers compatible interacting automata competing semantics competitive competitive competitive algorithm competitive algorithms competitive analysis competitive online scheduling competitive ratio competitive ratio MSF competitive ratio competitive scheduling competitiveness competitiveness competitiveness constant competitiveness features competitiveness result competiveness compilation compilation compilation of nets compilation phase compilation process compilation system compilation techniques compile compile time compiled compiled compiled base compiled language compiler compiler compiler construction compiler construction methodology compiler generation compiler methodology compiler named CAML compiler optimizations compiler optimizaton compiler specification compiler technology compilers compilers compile-time compile-time optimization compile-time transformations compiling compiling compiling algorithm compiling algorithm for expressions complement complement graph complement of complement of ω-languages complement of SBTA-languages complement of the equivalence problem for regular picture languages complement operation complementarity complementarity for P-matrices complementary complementary complementary hardness results complementary languages complementation complementation complementation lemma complementation of complementation of asynchronous cellular Bu¨chi automata complementation of Bu¨chi automata complementation of nondeterministic finite automata complementation operation complementation operator complementation problem for Bu¨chi automata complementation rule complemented complementing complements complements completable completable code complete complete complete 2-structure complete algebras complete algebras without rank complete and minimal axiomatization complete and sound complete and sound Hilbert-style proof system complete and sound proof systems complete and sound Rasiowa-Sikorski-style proof system complete axiom system for rational sets complete axiomatic complete axiomatic characterization of first-order temporal logic of linear time complete axiomatic characterizations of π-calculus bisimulation equivalences complete axiomatization complete axiomatization of complete axiomatization of observational congruence complete axiomatization of SDPDL complete axiomatizations complete axiomatizations of complete axiomatizations of first-order temporal logic complete axiomatizations of validity complete bases complete binary tree complete binary trees complete bipartite graph network topology complete Boolean algebras complete Brouwerian lattice complete categories complete characterization of functions computable by certain classes of Turing machines complete classes of automata complete classification complete classification of language equations complete conflict-free processes complete CTS complete database complete deduction system complete deductive system complete degree complete degrees complete divisibility problems complete E0L form complete ET0L forms complete extension complete extension of programs complete first order specifications complete first-order specifications complete for co-NE complete for embedded join dependencies complete for NP complete for P complete for PSPACE complete for PTIME complete for the α0-product complete for UP complete formal system complete functions complete functions for polynomial space complete graph complete graph network topology complete graph problems complete graphs complete grid graphs complete higher type equational calculus complete in P under log-space reductions complete inference rules complete inference system complete join semilattice complete languages complete languages for UP complete lattice complete lattice of complete lattice of monotonic predicate transformers complete lattice of sets of finite streams of substitutions complete lattices complete logic for reasoning about programs complete match query complete metacircularity complete metric complete metric space complete metric spaces complete metric topology complete modal proof complete modal proof system complete model of communicating processes complete models complete network of processors complete networks complete networks of processors complete nonredundant algorithm for reversed Skolemization complete on nested relations complete parametrization complete partial complete partial deduction complete partial order complete partial ordered set complete partial orderings complete posets complete prefix codes complete presentations complete probabilistic polynomial complete problem complete problem for P complete problems complete problems for complete problems for # complete problems for three alternations complete problems for two alternations complete process algebras complete proof complete proof rules complete proof system complete proof systems complete proof systems for equivalences on processes complete proof theory complete proofs complete propagating synchro-E0L forms complete p-m-degrees complete query languages complete query languages with external functions complete query-answering system complete recursive axiomatization complete recursively enumerable sets complete reduction scheme complete relation complete relation algebra complete relative to a set of sentences complete restrictions complete rewriting system complete routing tables complete schematization complete semantic unification procedure complete semantics complete semiformal proof system for specifications complete semirings complete semi-Thue systems complete semi-Thue systems for Abelian groups complete semi-Thue systems for presentations of finitely generated Abelian groups complete sequent calculus complete set complete set of assertions complete set of inference rules for join dependencies complete sets complete sets of complete sets of transformations complete sets of unifiers complete system complete system for extended join dependencies complete system of complete system of equational theories complete system of identities complete system of K-rational identities complete systems complete systems of rational identities complete theorem proving strategies complete traces complete traversal complete type inference problem complete ultrametric spaces complete under complete under Karp-reducibility complete under nonuniform one-way log-space reductions complete under polynomial-time many-one reductions complete unordered binary trees complete with respect to complete with respect to a semantics complete with respect to the simple type semantics completed completed completed data bases semantics completed database completed logic programs completed predicate definitions completely completely regular completely-specified table completeness completeness completeness and first-order logic completeness criteria completeness for completeness for attribute systems completeness for cascade composition completeness for metric temporal logics completeness for while-programs completeness issues completeness modulo a special second order theory completeness notions in PSPACE completeness of completeness of a completeness of a partial function logic completeness of a proof system completeness of a set of completeness of a set of identities completeness of a set of transformations completeness of a strong restriction of paramodulation completeness of a unification algorithm completeness of algorithms completeness of an algorithm for reversed Skolemization completeness of basic narrowing completeness of code selectro specifications completeness of codes completeness of complexity classes completeness of CSLD-resolution completeness of Curry's rules for assigning completeness of Curry's rules for assigning type schemes completeness of first-order temporal logic completeness of Floyd's method completeness of Floyd-Hoare derivability completeness of ground resolution completeness of hierarchical systems completeness of Hoare logic completeness of Hoare's logic completeness of Hoare's logic for while-programs completeness of Hoare-like proof systems completeness of inference rules completeness of inside-out reductions completeness of languages completeness of NAF rule completeness of narrowing completeness of narrowing strategies completeness of N-resolution completeness of Park induction completeness of PDL completeness of proof systems completeness of resolution completeness of rewriting systems completeness of simple Max Cut completeness of SLD resolution completeness of SLDNF-refutation completeness of SLDNF-resolution completeness of subtyping completeness of systems of meta-rules completeness of the completeness of the class P completeness of the intersection type discipline completeness of the membership problem completeness of the modal μ-calculus completeness of the nested algebra completeness of the optimal linear rearrangement problem completeness of the Qu-Prolog unification algorithm completeness of the reals completeness of the satisfiability problem for interleaving PDL completeness of the Segerberg axioms completeness of the specification completeness of the system of monoid identities completeness of transformations completeness of type assignment completeness of type assignment systems completeness of typechecking completeness proof completeness proof technique completeness proofs completeness properties of partially ordered sets completeness property completeness property of term rewriting systems completeness result completeness results completeness results for completeness results for Boolean algebras completeness results for proof systems completeness results for recursive flow diagram programs completeness results for SLD-resolution completeness results for time classes with linear alternation completeness theorem completeness theorem for completeness theorem for λ terms completeness theorem for dynamic logic completeness theorem for Hoare's calculus completeness theorem for NIL completeness theorem for second order lambda calculus completeness theorem for the completeness theorem for the μ-calculus completeness theorem for the order-sorted first-order predicate calculus completeness theorem for the Segerberg axiomatization of PDL completeness theorem for type checking completeness theorem for typing λ-terms completeness theorems completing completing completing biprefix codes completing programs completing sets completing specifications completing tables completing tables to satisfy functional dependencies completion completion algorithm completion divergent completion processes completion for rewriting completion for rewriting modulo a congruence completion for unification completion method completion modulo associativity completion of completion of a completion of a program completion of a set of equations completion of algebras completion of codes completion of countable I-categories completion of many-sorted conditional equations completion of nondeterministic automata completion of recognizable bifix codes completion of term-rewriting systems completion procedure completion procedures completion procedures for completion procedures for polynomials completion procedures for terms completion relation completion semantics completion semantics for abductive logic programs completion theory completion time completions completions of completions of perpetual logic programs completions of specification algebras complex complex analysis complex behaviour of nondeterministic algorithms complex Boolean functions complex Boolean networks complex coefficients complex database objects complex development of complex specifications complex formulas complex geometric objects complex geometrical decomposition complex images complex linear equations complex model complex model of Turing machines complex modules complex numbers complex object logical calculus with fixpoints complex objects complex polynomials with simple zeros complex power series complex programming complex programming problems complex system complex systems complex values complex variable function complexes complexities complexity complexity complexity analysis complexity analysis arbitrarily high complexity of roots complexity analysis of term-rewriting systems complexity border complexity bound complexity bounds complexity bounds for ordinal addition complexity class complexity class hierarchy complexity class NP complexity class NP/poly complexity class NPQUERY(A) complexity class PSPACE complexity class PTAPE complexity classes complexity classes of complexity classes of counting functions complexity classes of recursive complexity classes of recursive functions complexity classes of recursive predicates complexity classes without complexity classes without complete problems complexity classes without machines complexity core complexity core lattices complexity cores complexity expressions complexity for complexity for chain code picture languages complexity for Petri nets complexity function complexity function of a p-paperfolding sequence complexity gaps complexity hierarchy complexity hierarchy result for quantified propositional temporal logic complexity in complexity in analysis complexity in lower bounds complexity in measure complexity in mechanized hypothesis formation complexity measure complexity measure for complexity measure for 2-ATM's complexity measure for 2-tape Turing machines complexity measure of Boolean functions complexity measures complexity measures for parallel computers complexity measures for PRAM's complexity models complexity of complexity of 2-machine complexity of 2-machine flow-shop problems complexity of 2-machine open-shop problems complexity of 2-output Boolean networks complexity of 3-SAT problems complexity of a complexity of a finite dimensional algebra complexity of a learning task complexity of a membership problem complexity of a optimal policy complexity of a parity function complexity of a programming language complexity of a reachability equivalence problem complexity of a set-based database language complexity of abduction complexity of Abelian permutation groups complexity of algebraic complexity of algebraic circuits complexity of algebraic implementations complexity of algebraic polynomials complexity of algorithmic problems in free groups complexity of algorithms complexity of all-covers problem complexity of approximation in terms of queries complexity of arithmetic complexity of arithmetic expressions complexity of associative algebras complexity of automata complexity of Be´zout's theorem complexity of bisimulation equivalence complexity of Boolean algebras complexity of Boolean functions complexity of Boolean functions and networks complexity of Boolean networks complexity of Boolean-valued functions complexity of calulating the number of models of satisfiability formulas complexity of canonical function computation complexity of central slice functions complexity of class P complexity of classification problems complexity of coding sequences complexity of colouring problems complexity of colouring problems on dense graphs complexity of combinational networks complexity of combinator reduction machine complexity of comparison based problems complexity of computation complexity of computation of recursive programs complexity of computations complexity of computing complexity of computing modes complexity of computing symmetric functions complexity of computing the permanent complexity of conjugacy in monoids complexity of containment complexity of context free language recognition complexity of contextual languages complexity of context-free complexity of context-free grammars complexity of context-free grammars with 1-letter complexity of context-free language recognition complexity of continued fractions complexity of convex hulls complexity of counting complexity of counting homeomorphs complexity of counting strings complexity of covering problem complexity of cut formulas complexity of cut-formulas complexity of DATALOGCIRC complexity of decidable combinations of theories complexity of deciding complexity of deciding bisimilarity complexity of deciding fair termination complexity of deciding weak monadic sentences complexity of decision problems complexity of decision/quantifier elimination complexity of digital search trees complexity of dimension three complexity of discrete Fourier transform complexity of domino problems complexity of edge labelling complexity of embedding a graph complexity of equivalence complexity of equivalence between recursive programs complexity of equivalence for complexity of equivalence for arithmetic expressions complexity of equivalence for Presburger sets complexity of equivalence of complexity of equivalence of programs complexity of equivalence of recursive programs complexity of evaluating complexity of evaluating integers complexity of evaluating integers and polynomials complexity of evaluating interpolation polynomials complexity of evaluating polynomials complexity of extensions complexity of fair nontermination complexity of fairness complexity of finding complexity of finding minimum-length generator sequences complexity of finite languages complexity of first-order logic with arithmetic complexity of functions complexity of Gentzen systems complexity of grammatical covering complexity of graph embeddability complexity of graph embeddability problems complexity of Grigorchuk groups complexity of group algebra computations complexity of halting problem complexity of heap operations complexity of heapsort complexity of HNN extensions complexity of identifying the number of connected components complexity of inequalities complexity of inequivalence problem complexity of inference systems complexity of integer sorting complexity of integrals complexity of integrals of real functions complexity of intersection and conjugacy in free groups complexity of intersection problems complexity of iteration of polynomial equations complexity of iterations complexity of i-adaptive search complexity of Karp-Miller procedure complexity of languages complexity of languages ω-type Turing acceptors complexity of languages operators complexity of languages packet routing complexity of learning strings complexity of limit values of word sequences complexity of linear programming complexity of location problems complexity of logical theories complexity of loops complexity of Markov decision complexity of matrix complexity of matrix computations complexity of matrix multiplication complexity of matrix transposition complexity of merging complexity of monadic complexity of monadic recursion complexity of monadic recursion schemes complexity of monadic second-order formulas complexity of monotone Boolean functions complexity of monotone networks for Boolean matrix product complexity of Muller automata complexity of multiplication in algebraic extension fields complexity of multiplication in finite fields complexity of node searches complexity of nondeterministic counter languages complexity of normal form grammars complexity of optimizing finite-state transducers complexity of PA's complexity of parallel complexity of parallel matrix computations complexity of parallel parsing complexity of partial derivatives complexity of partially observed Markov decision processes complexity of path-forming games complexity of PDL with interleaving complexity of picture languages complexity of polynomial systems of equations complexity of polynomials complexity of polynomials with algebraic coefficients complexity of Presburger arithmetic complexity of primality complexity of production complexity of productions complexity of proof complexity of proof of termination complexity of proof procedures complexity of p-generic sets complexity of quantifier elimination complexity of queries complexity of query answering complexity of query evaluation complexity of query processing complexity of reachability complexity of reasoning complexity of rectangular matrix multiplication complexity of regular resolution complexity of rewriting systems complexity of roots of polynomials complexity of SAT complexity of satisfiability complexity of satisfiability for Krom formulas complexity of SCS problems complexity of selection complexity of single power sums complexity of slice functions complexity of slices complexity of solution algorithms complexity of solving complexity of sorting complexity of specification morphisms complexity of structure complexity of subclasses of Presburger arithmetic complexity of subgraph isomorphism complexity of symmetric complexity of symmetric Boolean functions complexity of symmetric polynomials complexity of target classes complexity of task assignment complexity of testing complexity of the equivalence problem complexity of the inequivalence complexity of the set of complexity of the set of Lyndon words complexity of the set of primitive words complexity of the tree automorphism problem complexity of the word problem for Abelian l-groups complexity of theorem proving complexity of theories complexity of theories of permutations complexity of tile rotation complexity of tiling recognition complexity of trace equivalence complexity of uniform simulation complexity of uniformly nonprimitive labeled 2-structures complexity of unique solutions complexity of update and retrieve transactions complexity properties complexity question NP ≠ co-NP complexity question NP ? co-NP complexity relative a slowly utilized oracle complexity results complexity results for necklace tours complexity results on conjugacy in monoids complexity sequence complexity specifications complexity theorems complexity theoretic approach complexity theory complexity theory of efficient parallel algorithms complexity trade-offs for complexity trade-offs for circuits complexity trade-offs for range query problems complexity values complexity values for distributed election on bidirectional rings of processors complex-object databases complicated processed jobs component component automata component automata of networks component grammars component stochastic systems components components components in intersections of D0S languages components of components of distributed computing agents components of nets components with pseudostochastic transition matrices composing composing assumption/guarantee specifications composing elementary processes composing event oriented concurrent systems composing subsystems composite composite composite modulus composite numbers composite rule composite transformation rule compositeness composition composition composition functions composition of composition of atomic semicommutations composition of basic combinators composition of computations composition of constructor systems composition of datalog program mappings composition of derivation steps composition of functions composition of implementations composition of parallel functions composition of polynomials composition of power series composition of relations composition of sets of terms composition of tree transformation classes composition operation composition operations composition operator composition operators composition powers composition problem composition problem for composition problem for power series composition problem for univariate complex power series composition problem of power series with integer coefficients composition rules compositional compositional compositional analysis compositional analysis of full CCP compositional axiomatic system compositional axiomatization compositional axiomatization of statecharts compositional context compositional formal semantics compositional formalism compositional framework compositional method compositional models compositional network proof theory compositional program verification compositional proof systems compositional rules for hiding compositional rules for restriction compositional semantic basis compositional semantics compositional specifications compositional syntax-directed proof system compositional transition systems compositional verification compositional verification of UNITY programs compositionality compositionality compositionality of satisfaction compositions compositions compositions of compositions of basic combinators compositions of morphisms compositions of non-erasing morphisms compositions of power series compositions of probabilistic I/O automata compositions of programs compound compound actions compound timed behaviours compounds comprehend form comprehension comprehension axioms comprehension categories comprehension principle comprehensive fibrations compressed compressed forms of programs compressibility compressibility of information compressible compressible string compressing compressing data compressing images compression compression compression ratio compression theorem compromise compromise in answering queries Compton Compton computability computability computability concepts computability concepts for programming language semantics computability for queries computability in higher types computability of computability of a map computability of conditional systems computability of cooperation computability of recurrence equations computability of systems computability of the minimal solution of a fixpoint equation computability on computability on continuous higher types computability on metric spaces computability on metric spaces with Polish topology computability properties of sets computability questions computability theory computability via a relation ν computable computable computable by finite automata computable concurrent processes computable data types computable extensional functions computable function computable functionals computable functions computable functions of computable functions of one variable computable functions of power algebras of sets of states computable functions over cpo's computable functions over cpo's computable functions polynomial-time ~ computable identities computable isomorphisms computable metric spaces computable monotonically increasing function computable natural number computable operators computable parameters computable problem computable process functions computable queries computable real functions computable real numbers computable real valued function computable real-valued computable real-valued function computable real-valued functions computable real-valued relations computable reductions computable relations computable retraction computable semilinear computable semilinear set computable sequence computable sequence of programs cofinal in running time computable sequential computable sequential normalizing reduction strategy computable sequential reduction strategy computable time computable transformation computably computably computably recursively definable process computation computation computation category computation diagram computation diagram for CTS's computation domains computation graphs computation mechanisms computation models computation of computation of bilinear mappings computation of Boolean matrix products computation of characteristic sets computation of clauses computation of critical pairs computation of functions computation of functions over universal algebras computation of GCD computation of generating functions computation of local constraints computation of partial recursive functionals computation of rational polynomials computation of recursive functionals computation of recursive programs computation of repetitions computation of supervisors computation of through schemes computation over a ring computation path computation paths computation rule computation semantics computation sequence computation sequences computation sharing computation strategy computation system computation time computation to communicate computation tree computation tree logic computation trees computation universal computational computational computational adequacy computational adequacy results computational aspects of concurrent systems computational behaviour computational capabilities computational capabilities of hybrid systems computational complexity computational complexity for dynamic problems computational complexity of computational complexity of comparison based problems computational complexity of contextual languages computational complexity of functions computational complexity of languages computational complexity of multiplication in algebraic extension fields computational complexity of Prolog programs computational complexity of real computational complexity of real addition computational complexity of real functions computational complexity of satisfaction computational complexity of satisfiability computational complexity of satisfiability in propositional logics computational complexity of systolic trellis automata computational complexity of the discrete Fourier transform computational complexity of universal hashing computational complexity sequences computational complexity theory computational depth computational difficulty computational efficacy computational efficiency computational efficiency gains by cancellation computational experiments computational formalization computational foundations computational geometry computational independence computational indistinguishability computational interpretation of well behaved bp schemes computational interpretations computational interpretations of linear logic computational intractability computational learning computational learning theory computational linguistics computational logic computational meaning computational metaphor computational model computational model for computational model for measure theory computational model for metric spaces computational models computational models of formal languages computational monad computational network computational optimization problems computational paradigms computational power computational power of computational power of automata computational power of automata with time-space bounds computational power of depth-2 circuits computational power of dynamical systems computational power of finite Church-Rosser thue systems computational power of hybrid systems computational power of ITA's computational power of neural networks computational power of PP computational power of self-stabilizing systems computational power of simple programming languages computational power of two way automata computational power of two-way automata computational problems computational properties computational properties of lambda expressions computational requirements in parallel computing computational semantics computational steps computational style computational systems computational techniques computational theory of recursive analysis computational use of proofs computationally computationally computationally convincing protocols computationally equivalent computationally intractable computationally tractable computationally universal computational-tuple sequence scheme computations computations computations as ideals computations in BPP-nets computations in monoids and groups computations in polynomial-time computations of computations of (α,k)-machines computations of a computations of a CTS computations of a through scheme computations of bilinear mappings computations of GCD's computations of rational polynomials computations on computations on graphlike expressions computations on real numbers computations on Turing machines computations over computations over aperiodic monoids computations over finite monoids computations over terms with bound variables computations relative to computations relative to functions of natural numbers computations relative to sets of natural numbers computations versus algebraic specifications computation-tuple sequence scheme computation-universality of a reversible CM(2) computer computer computer algebra computer algebra system computer algebra systems computer assisted proofs computer graphics computer programming computer science computers computer-aided computer-aided geometric design computer-aided tomography computer-assisted proof constructions computer-controlled robot computer-oriented theory computing computing a set of defining relations computing agent computing agents computing aggregate functions computing architecture computing by splicing computing decorations computing differentiable functions computing environments computing functions computing ideal bases computing in unpredictable environments computing minimum embeddings computing minimum embeddings of complete binary trees computing mode computing power computing power of systolic trellis automata computing stable models computing symmetric functions computing the order of an element computing the rank of a matrix computing time of a computing time of a bubbling system computing time of a circuit computing well-founded models computing with infinite objects concatenable concatenable processes concatenation concatenation concatenation by languages concatenation from the left concatenation from the left by a constant language concatenation from the left operation concatenation hierarchy concatenation of concatenation of continuous words concatenation of FIFO buffers concatenation of infinite traces concatenation of languages concatenation of one-way simple multihead automata concatenation of real-time CA languages concatenation operation concatenation operations concatenation operator concatenation product of monoids concatenation program operator concatenation with regular sets concatenations concatenations concave concave gap cost functions concavity concavity concealment concensus concentration concentration concept concept class concept classes concept formation approach concept lattice concept learning from examples concept space concepts conceptual conceptual analog conceptual analog computer conceptual content of proofs conceptual reduction conceptual state conceptual state specifications conceptual state variables concrete concrete approximations concrete computations as ideals concrete data structures concrete domains concrete dynamic-data type concrete machine concrete mathematics concrete physical models concrete terms concurrence concurrency concurrency concurrency and hiding in an abstract rewriting machine concurrency control concurrency control algorithm concurrency control problem concurrency control protocols concurrency equivalences concurrency for multiprogramming concurrency information concurrency model concurrency model of CCS concurrency monoids concurrency of concurrency of events concurrency of graph manipulations concurrency of processes concurrency relations concurrency semantics concurrency theorem concurrent concurrent concurrent λ-calculus concurrent access to a database concurrent agents concurrent algorithms concurrent alphabets concurrent alternating bit protocol concurrent automata concurrent automaton concurrent behavior concurrent behaviour concurrent behaviour in Petri net theory concurrent behaviour of process terms concurrent Boolean programs concurrent calculi concurrent calculus concurrent communication concurrent components concurrent computation concurrent computations concurrent computing systems concurrent constraint logic concurrent constraint logic languages concurrent constraint logic programs concurrent constraint paradigm concurrent constraint programming concurrent distributed systems concurrent dynamic logic concurrent evolution concurrent evolution of nonsequential systems concurrent execution concurrent execution of agents concurrent expressions concurrent finite-state programs concurrent firing concurrent imperative languages concurrent interacting systems concurrent language concurrent language with recursion concurrent languages concurrent logic concurrent logic languages concurrent logic programming concurrent logic programming shell concurrent logic programs concurrent modular systems concurrent nondeterministic processes concurrent operations concurrent paradigms concurrent phenomena concurrent process concurrent process calculi concurrent process paradigm concurrent processed jobs concurrent processes concurrent production concurrent program concurrent program design concurrent program schemes concurrent programming concurrent programming language concurrent programming languages concurrent programs concurrent Prolog concurrent read exclusive write concurrent reading concurrent regular expressions concurrent rewriting concurrent semantics concurrent specifications concurrent structure concurrent system concurrent system behaviours concurrent system specification concurrent systems concurrent systems with conflicts concurrent timers concurrent transactions concurrent transition system concurrent transition systems concurrent while language concurrent write concurrent writes concurrent writing concurrently concurrently executing programs concurrent-read concurrent-write concurrent-read concurrent-write parallel algorithms concurrent-read concurrent-write PRAM concurrent-read-exclusive-write parallel random access machine concurrnent condensed condensed condensed phase combustion condensed reduction graphs condition condition max condition number condition of well-behavedness conditional alphabet axioms conditional answers conditional axioms conditional branching conditional branching as a control structure conditional commutativity conditional equational conditional equational logic conditional equational programming conditional equational theories conditional equations conditional independence conditional inductive generation conditional limiting distributions conditional narrowing conditional probability measures of infinite traces conditional program operator conditional regular grammars conditional rewrite rules conditional rewrite rules modulo a set of structural axioms conditional rewrite systems conditional rewriting conditional rewriting logic conditional rewriting program conditional specifications conditional specifications partial conditional systems conditional systems of uniform recurrence equations conditional term rewriting systems conditional traces conditionally conditionally dependent conditionally dependent process conditionals conditionals conditional-equational theory conditioned-tables conditioning conditions conditions for conditions for context-free languages conditions for convergence conditions for positiveness conditions for reductions conditions for regularity of languages conditions for strong relative incompleteness conditions for time constructibility conditions of conditions of equivalence of automata conditions of regularity conditions on candidates of reducibility conditions on reductions condition-event systems Condon Condon cone cone of context-free languages cones cones cones in Rn configuration configuration configuration graph configuration spaces configurations configurations configurations growth configurations of noncrossing paths conflict conflict free MVD set conflict relations conflicting conflicting access to databases conflicting accesses to a database conflicting actions of an LR0 collection conflicts conflicts between rules conflict-free conflict-free covers conflict-free Petri nets conflict-freeness confluence confluence confluence by orthogonality proof method confluence criteria confluence for confluence for graph transformations confluence for process verification confluence for PRS's confluence for rewrite systems confluence in processes confluence of confluence of a Noetherian trace replacement system confluence of basic semi-Thue systems confluence of orthogonal PRS's confluence of rewriting confluence of rewriting modulo equations confluence of rewriting systems confluence of string-rewriting systems confluence of the Lambda-calculus confluence of the partial λ-calculus confluence preserving transformations of rewrite systems confluence problem confluence proof for λ-calculus confluence properties of CCL confluence properties of CCLβη SP confluence property confluence results for CCL confluence system confluence systems confluence term rewriting systems confluency confluency confluent confluent confluent calculus confluent congruence confluent c-systems confluent equational theory confluent graph rewriting system confluent linear numeration systems confluent monadic string-rewriting systems confluent presentation confluent reduction system confluent relation confluent rewrite confluent rewrite rules confluent rewrite system confluent rewriting systems confluent semicommutation systems confluent semi-Thue system confluent string-rewriting systems confluent term rewriting systems confusion confusion in net theory conglomerates congruence congruence congruence class congruence classes congruence generated by Thue systems congruence of congruence of continuation semantics congruence of definitions congruence of denotational semantics congruence of programming language definitions congruence on a monoid congruence on the language of λ-expressions congruence relation congruence relations congruence relations on congruence relations on a term algebra congruence relations on abstract data types congruence relations on computing agents congruence semantics congruence theory congruence theory of closure properties of regular tree languages congruence with respect to functors congruences congruences congruences for rewriting systems congruences generated by Church-Rosser systems congruences in finite algebras congruences in rings congruences of term algebras congruences on congruences on terms of languages congruences on the algebra of regular trees congruent congruent congruent definitions congruent processes congruential congruential congruential functions congruential tree languages conjecture conjecture conjecture of conjecture of Aanderaa and Rosenberg conjecture of Anderaa and Rosenberg conjecture of Bergstra conjecture of Bergstra and Tucker conjecture of Bergstra et al. conjecture of Berman conjecture of Berman and Hartmanis conjecture of Bucher and Culik conjecture of Dejean conjecture of Dezani-Ciancaglini conjecture of Ehrenfeucht conjecture of Guthrie conjecture of Jantzen conjecture of Klop conjecture of Le´vy conjecture of Le´vy et al. conjecture of Langmaack and Olderog conjecture of Lewis et al. conjecture of Me´tivier conjecture of Meseguer conjecture of Moggi conjecture of Perrin conjecture of Plaisted conjecture of Plotkin conjecture of Restivo et al. conjecture of Rosenberg conjecture of Schnorr conjecture of Shaw conjecture of Stoughton conjecture of Yao conjecture of Yap conjecture on conjecture on completeness of typing rules conjecture on DFS conjecture on edge colouring conjecture on Sturmian sequences conjecture on typing rules conjectured semilinear set conjectures conjectures of Conway conjectures of Kósa conjoined conjoined negative constraints conjugacy conjugacy conjugacy for finite complete rewriting systems conjugacy for rewriting systems conjugacy in monoids conjugacy of dynamical systems conjugacy problem conjugacy problem in conjugacy problem in groups conjugacy problem in monoids conjugacy problems conjugacy problems for monoids conjugacy problems in free groups conjugacy relation conjugate conjugate conjugate kernel conjugate zeros conjugation conjugation conjugation class conjugation of standard morphisms conjunction conjunction conjunction of conjunction of aggregation constraints conjunction of literals conjunctions conjunctions conjunctive conjunctive conjunctive actions conjunctive case conjunctive complexity conjunctive form conjunctive nature conjunctive normal form conjunctive normal form of extended Skolem conjunctive normal form of extended Skolem arithmetic conjunctive predicate conjunctive predicate transformers conjunctive queries conjunctive reducibility conjunctively conjunctively conjunctively and disjunctively reducible to a sparse NP-complete set conjunctively reducible set conjunctively reducible to a sparse set conjunctive-disjunctive λ-calculi conjunctive-disjunctive λ-calculus connectability connected connected combinatorial optimization problems connected combinatoric manifold connected component connected dominating set problem connected graphs connected input-output pairs connected minimal set system connected models connected noncommutation graph connected object connected occurrences connected oracle separation results connected picture connected planar maps connected plane graphs connected regions connected relations connected relations over F-domains connected sets connected solutions connected subgraph problem connected tessellation automaton connectedness connectedness connectedness of pictures connection connection graph connection graph proof procedure connection graphs Connection Machine Connection Machine 200 parallel computers Connection Machine CM200 connection method connection path connections connections among attributes connections between powerdomains connections in acyclic hypergraphs connection-trap-free connective connective connective of negation connectives connectives connectivity connectivity connectivity predicate connectivity requirement coNP coNP coNP-complete cons operation consecutive consecutive cells consensus consensus consensus problems consequence consequence operator consequence relation consequence relations consequence verification method conservation conservation result conservative conservative extension conservative extension of first-order logic with fixpoints conservative extension of ML programming language conservative extension theorem conservative extensions conservative extensions of syntax conservative learners conservative monoids conservative probabilistic learning conservative refinements conservative refinements of specifications conservative semantics conservativity conservativity conservativity over ACP consistency consistency consistency and completeness consistency condition consistency condition for heuristics consistency of consistency of ACPτ consistency of databases consistency of Koomen's fair abstraction rule consistency of lexicographic order with a natural order consistency of optimal fixed point semantics with the van Emden-Kowalski semantics of logic programs consistency of type consistency ofmap theory within ZFC+SI consistency proof consistency techniques consistency theorems consistent consistent axiom system for rational sets consistent completion consistent extension consistent framework consistent information consistent marking consistent names consistent Petri net consistent program consistent sequence consistent sequence optimisation problems consistent sequence problems consistent sequences consistent set of axioms consistent subsequence consistent supersequence consistent superstring consistent superstrings consistently complete poset Console Console et al. Constable Constable's Constable's V3 constant constant alternations constant approximate tours constant average cost constant bounded treewidth constant bounds constant competitive algorithm constant deadline constant depth constant factor approximation constant functions constant functors constant languages constant length codes constant memory requirements constant number of negative strings constant propagation constant reversals constant rules constant service time deadline constant size alphabets constant space constant target constant test complexity constant time constant vector field constants constants constants as atomic terms constant-degree parallel architectures constant-depth constant-depth circuits constant-depth formula constant-depth formulae constant-depth polynomial-size circuits constant-factor approximation algorithm constant-formula-depth constant-formula-depth Frege proof systems constituent functions constrained constrained completion constrained dependencies constrained equivalence constrained equivalence assertions constrained equivalence of programs constrained rewriting constrained rewriting modulo associativity constrained set of available sequences constraint constraint constraint databases constraint domain constraint domains constraint entailment constraint equation constraint equational theory constraint graphs constraint language constraint logic programming constraint logic programming framework constraint logic programming language constraint logic programming languages constraint logic programs constraint manipulation constraint module technique constraint nets constraint networks constraint programming constraint query languages constraint replacement constraint satisfaction constraint satisfaction problem constraint satisfaction problems constraint sets constraint solvers constraint specifications constraint system constraint systems constraint unsatisfiability constraint varieties constraints constraints constraints in constraints in a database scheme constraints in distributed systems constraints in relational databases constraints of FT constraints of real time simulation constraints on constraints on communication constraints on control problems constraints on databases constraints on parametrized data types constraints on sets of computation paths constraints on the constraints on the order of updates constraints on the set of possible beliefs constraint-based grammar formalisms constraint-free constraint-oriented specification style constraint-solving problems constructability constructability constructability of exact regular expression constructable constructable regular language constructibility constructible constructible constructible differentially finite algebraic series constructible function constructible functions constructible geometric functions constructible sequences constructing constructing an automaton from an expression constructing competitive tours constructing factorization forests constructing free theories constructing hyperuniverses constructing logical inferences constructing minimal subalgebras constructing Minkowski reduced lattice bases constructing models constructing models of IOCC constructing optimal constructing optimal alphabetic trees constructing optimal regular MBD constructing optimal regular mbd constructing optimum binary search trees constructing oracles constructing proofs constructing representations of ω-words construction methods construction of construction of a free model of a theory construction of a modular proof system construction of codes construction of compilers construction of complex Boolean functions construction of constants construction of free algebras construction of interval representations construction of iterative algebras construction of linear size construction of long nonrepetitive words construction of maps with perscribed automorphism group construction of optimal gossip algorithms construction of oracles construction of parallel computers construction of programs construction of search spaces construction of sketches constructions constructions for constructions for complementing Bu¨chi automata constructions for factors of Sturmian sequences constructions in abstract algebraic institutions constructions of constructions of abstract search spaces constructions of least fixed points constructions of ordinary free algebras constructions of programs constructions with compass and ruler constructions with recursion constructive constructive constructive algebraic specification constructive domain constructive domain theory constructive equivalence constructive extensional choices constructive logic constructive logics constructive mathematics constructive negation constructive network model constructive ordinals constructive pattern constructive proofs constructive proofs in modal logics constructive propositional logic constructive separations constructive set theory constructive system constructive system for automatic program synthesis constructive topological analysis constructive type constructive type theories constructive type theory constructive universal algebra constructive upper bound constructive w.r.t. negation constructor constructor constructor based rewrite systems constructor function constructor sharing systems constructor systems constructor trees constructor trees of Herbrand constructors constructors constructor-based systems constructor-sharing constructor-sharing data modeling constructor-sharing constructor-sharing rewrite systems constructor-sharing systems constructs contact contact circuit complexity contact in net theory containment containment containment hierarchy containment inference containment of polygons containment problem containment problem for ω-ERE's containment problems containment problems for containment problems for families of DPDA's containment problems for picture languages containment relations containments Contejean Contejean and Devie context context context constraints context defined ranges of inputs and outputs context dependence context dependent equivalence context dependent equivalences context dependent semi-Thue systems context filling operations context free context free array languages context free complexity of context free complexity of finite languages context free complexity of languages context free control sets context free E0L forms context free edge labelled graphs context free emptiness context free formalism context free generator context free generators context free grammar context free grammar forms context free grammar selector context free grammars context free grammars in Greibach normal form context free grammars over signatures context free grammars with context free grammars with 1-letter context free grammars with 1-letter complexity of context free grammars with 1-letter context free grammars with ambiguity context free grammars with cancellation properties context free graph grammars context free graphs context free graph-grammars context free groups context free inventory context free language context free language decision problem context free language recognition context free languages context free languages depth in EDT0L languages context free like restrictions context free logic context free NLC set of graphs context free parsing context free parsing algorithm context free picture context free picture language context free picture languages context free processes context free productions context free recognition context free regular languages context free rewriting context free rules context free set context free sets context free string grammars context free substitution context free systems context free trace languages context free tree grammars context free tree languages context free trees context freeness problems context free-like structure context in a rewriting process context independent semi-Thue systems context information context of continuous posets context sensitive context sensitive adherences context sensitive case context sensitive description context sensitive form of context free languages context sensitive grammar context sensitive grammars context sensitive grammars with context free control sets context sensitive language context sensitive languages context sensitive probabilistic knowledge bases context specific context specific information context specific synchronization contexts contexts contextual contextual contextual equality contextual grammars contextual languages context-defined ranges of inputs and outputs context-dependence context-dependent semi-Thue systems context-filling operations context-free context-free array languages context-free complexity context-free complexity of context-free complexity of finite languages context-free complexity of inite languages context-free complexity of languages context-free control sets context-free E0L forms context-free edge labelled graphs context-free emptiness context-free formalism context-free generalized context-free context-free generator context-free generators context-free grammar context-free grammar forms context-free grammar selector context-free grammars context-free grammars in Greibach normal form context-free grammars over signatures context-free grammars with context-free grammars with 1-letter context-free grammars with ambiguity context-free grammars with cancellation properties context-free graph grammars context-free graphs context-free graphs of Muller and Schupp context-free graph-grammars context-free groups context-free inventory context-free language context-free language decision problem context-free language recognition context-free languages context-free like restrictions context-free logic context-free NLC set of graphs context-free parsing context-free parsing algorithm context-free picture context-free picture language context-free picture languages context-free processes context-free productions context-free recognition context-free regular languages context-free rewriting context-free rules context-free set context-free sets context-free string grammars context-free subclasses of generalized context-free context-free substitution context-free systems context-free trace languages context-free tree grammars context-free tree languages context-free trees context-free v context-freeness problems context-free-like structure context-independent semi-Thue systems context-sensitive context-sensitive adherences context-sensitive case context-sensitive description context-sensitive form of context-free languages context-sensitive grammar context-sensitive grammars context-sensitive grammars with context-free control sets context-sensitive language context-sensitive languages context-sensitive probabilistic knowledge bases context-specific context-specific information context-specific synchronization contiguous contiguous block contigurations continuants continuation continuation continuation capture continuation concepts continuation semantics continuation semantics domains continuation semantics for flowgraph equations continuation technique continuations continuations continuation-based semantics continued fraction continued fraction algorithms continued fraction based algorithms continued fraction expansion continued fraction expansions continued fraction representation continued fraction representation of real numbers continued fraction representations continued fraction transformation continued fractions continuity continuity continuity concept continuity in cpo's of measures continuity in domains continuity of continuity of computable functions continuity of functionals continuity of merge continuity of operators continuity of semantic operators continuity of sequential composition continuity of the reals continuity of total effective operators continuity of trace continuity of type continuity problems continuity spaces continuous continuous μ-calculus continuous algebras continuous approximation continuous bounded-complete domains continuous complete lattices continuous components continuous control systems continuous cpo continuous cpo-functions continuous dcpo continuous domains continuous dynamic algebras continuous dynamical systems continuous endofunctions continuous endomorphisms continuous environment continuous fixed-point operator continuous function continuous function model continuous function model of PCF continuous functional continuous functionals continuous functions continuous functions on metric spaces continuous functor continuous ground domains continuous higher types continuous information systems continuous interpolating functional continuous inverse images continuous lambda models continuous lattice continuous lattice solution continuous lattices continuous mappings continuous nonlinear control systems continuous operators continuous optimization problems continuous periodic function δ continuous plant continuous plants subject to disturbances continuous poset continuous posets continuous predicate transformers continuous retraction continuous Scott domain continuous search continuous semantics continuous semantics for unbounded nondeterminism continuous semantics for unbounded nondeterminism and continuous semilattices continuous spaces continuous structures continuous subsystems continuous time continuous time interpretation of TLA continuous traces continuous traces semantics continuous type hierarchy continuous variables continuous weight continuous weight and distance cpo continuous weight cpo continuous words continuously continuously generated fixed points continuously operating systems continuous-state continuous-state dynamical systems continuous-time computation contour contour integration contracting contracting contracting a redex contracting functors contraction contraction contraction inference rules contraction of a string contraction rule contraction rule for η contraction rule for surjective pairing contractions contractions contraction-free contractum contractum contradiction contrasting models contravariant contravariant functor control control control algorithms control automata control environment control flow constructs control grammars control in multi-agent systems control language control language hierarchy control machines control mechanism control mechanisms control nodes control of control of instrumentation overhead control of operations on T0L systems control operators control policies control power of integer division control problem in distributed systems control problems in distributed systems control rules for concurrent systems control set control strategies control structure control structure modification control structure of control structure of a data space control structure of programs control structures control structures of programming languages control structures of programs control structures with forks and joins control structures with joins control structuring control system control systems control theory control triangle control vectors controllability controllability controllability in Petri nets controllability problem for Petri nets controllable controllable events controlled controlled controlled concurrent expressions controlled deterministic table 0L array systems controlled real-time application controlled regular expressions controlled retransmission probability controlled rewriting systems controller controller controller supervising controlling controlling controlling computations controlling computations as ideals controlling concurrent access to a database controlling the composition of derivation steps controls convenient methods of representation convenient semantics conventional instructions conventional programming instructions conventional semantics convergence convergence convergence generalized convergence in convergence in metric spaces convergence in preorders convergence of convergence of distributions of search cost convergence of functions convergence of functions to fixedpoints of recursive definitions convergence of initial program executions convergence of probability laws convergence properties of unification algorithms convergence to fixedpoints convergent convergent convergent critical pair convergent models convergent rewrite convergent rewrite rule system convergent rewrite system convergent rewriting system convergent sequences convergent stochastic process convergent term rewriting system convergents converging conversativity conversativity results converse of converse of Homer's result converse of Tarski-Kleene-Knaster theorem converse of the Tarski-Kleene-Knaster theorem conversion conversion convertibility convertible converting converting a string converting decision tables to programs converting formats converting noninteractive zero-knowledge proofs convex convex convex cost function convex gap cost functions convex geometric approach convex geometry convex hull convex hull of a polygon convex hull problems convex hulls convex hulls of polytopes convex layer problem convex polygon convex polyhedra convex polyhedra in three-dimensional space convex polyhedral obstacles convex polyhedron convex polyhedron moving convex polyominoes convex power domains convex powerdomain convex powerdomain constructors convex powerdomains convexity convexity convexity of theories convex-bipartite graphs convex-hull construction convolution convolution convolution of sequences convolution of vectors convolutions convolutions of signals Conway Conway Conway CCC Conway identities Cook Cook Cook and Reckhow Cook and Rockoff Cook complete Cook's Cook's completeness theorem Cook's conjecture Cook's NP-completeness theorem Cook's theorem Cook's thesis NP ? P Cooper cooperating cooperating conditional regular grammars cooperating grammar systems cooperating grammars cooperating mathematical software packages cooperation cooperation condition cooperation in context-free grammars cooperation strategies coordinate coordinated coordinated coordinated pair system coordinated selective substitutions coordinated table selective substitution systems coordinates coordinates coordinating coordinating coordinating agents coordinating independent programs coordinating multi-agent groups coordinating starting times coordination coordination coordination languages coordination mechanisms coordination primitives coordinatizing coordinatizing environment models coordinators Coppersmith Coppersmith Coppo Coppo Coppo and Dezani-Ciancaglini Coppo Dezani and Veneri Coppo et al. Coppo-Dezani Coppo-Dezani types coprimality coprimality coprimality of numbers coprime coprocessors coprocessors coproduct coproduct on synchronization trees coproducts coproducts cops copy rule copying copying a gene copying top-down tree transducers copy-constant propagation Coquand Coquand-Huet calculus Coquand-Huet calculus of constructions Coquet Coquet Corasick Corasick Corasick and Aho Cord Cord Cordy Cordy and Barnard coreflection coreflection coretraceable coretraceable r.e. set Cori Cori coroutine coroutine computation coroutines coroutines Corput correct correct and complete for entailment and disentailment correct behaviours correct interpretation correct prefix parser correct prefix parsers correct prefix parsers operating in linear time correct programs correct top-down proof procedure correct transformations correctness correctness and nondeterminism and correctness assertions correctness criteria correctness logic correctness of correctness of a correctness of a compiler correctness of a distributed sorting algorithm correctness of a parametrized specification correctness of a program correctness of a program for the McCarthy airline reservation system correctness of a program transformation rule correctness of a pushout implementation of term rewriting correctness of a typed ω-order λ-calculus correctness of abstract data types correctness of an CCP algorithm correctness of an implementation correctness of asynchronous correctness of asynchronous circuits correctness of asynchronous parallel programs correctness of asynchronous systems correctness of automatic techniques correctness of closure algorithms correctness of CLP transformation systems correctness of code generation correctness of complicated asynchronous circuits correctness of concurrent processes correctness of CSP programs correctness of derivations correctness of distributed systems correctness of flowchart programs correctness of formalisms correctness of implementations correctness of modular systems correctness of nondeterministic programs correctness of parallel programs correctness of parsing correctness of parsing algorithms correctness of parsing schemata correctness of probabilistic correctness of probabilistic algorithms correctness of program transformations correctness of programs correctness of programs of PASCAL-like procedures correctness of real-time distributed systems correctness of recursion-based automatic program transformations correctness of reduced systems correctness of regular deterministic programs correctness of solutions of the nil-total exclusion problem correctness of specifications correctness of subsystems correctness of the correctness of the bitonic sorting algorithm correctness of the Hu-Tucker algorithm correctness of the MATCH algorithm correctness of the Qu-Prolog unification algorithm correctness of transformation rules correctness of transformations correctness of translation correctness of type-checkers correctness preserving transformations correctness proof correctness proof for learning correctness proof of the Garsia-Wachs algorithm correctness proof of the Hu-Tucker algorithm correctness proofs correctness proofs of CSP programs correctness tests correctness theories correctness with respect to a semantics correctness-preserving transformations correspondence correspondence correspondence between closed Cartesian categories and λ-calculi correspondence between nets and circuits correspondence theory correspondences corssing corssing set game corssing sets cosemicomputable cosemicomputable algebras coset coset intersection Cosnard Cosnard and Ferreira cost cost cost calculus cost function cost functions cost models for the paging problem cost of cost of binary search trees cost of character substitutions cost of computation cost of insertion in digital search trees cost of operators cost of processing cost of substring cost of substring deletions cost of substring insertions cost pie of assigning tasks cost sets Costa Costa and Hennessy costed costs costs costs of costs of accepting computations costs of access costs of constructing search trees costs of evaluation costs of gaps in DNA sequences costs of operators costs of substitution in DNA sequences COSY COSY COSY path COSY path expression formalism COSY path expressions COSY path programs count count modulo p countable countable countable Cartesian product countable Cartesian products countable graph countable nondeterminism countable nondeterminism and countable partial ordering countable poset countable set countably countably countably algebraic counter counter counter configuration counter machine counter machine strategy counter machines counter reversals counter scheme counterexample counterexample to counterexample to Reingold's characterization counterexample to Schnorr's conjecture counterexample to Shyamasundar's characterization of pushdown permuters counterexample to the Church-Rosser property counterfeit counterfeit coin problem counterintuitive counterintuitive results counters counters counter-example to Meseguer's conjecture counter-free regular languages counting counting capabilities counting class counting class UP counting classes counting complexity class counting factors counting functions counting generating functions counting homeomorphs counting in two ways principle counting method counting monadic second-order logic counting occurrences of given subsets of words counting of colourings counting parallelogram polyominoes counting paths counting prefixes of traces counting problem counting problems counting quantifiers counting recognizable strings counting SAT solutions counting sequences counting sequences of combinatorial structures counting strings problem counting version of combinatrorial problems coUP coUP coupled-context-free coupled-context-free grammars couplers couples coupling coupling coefficients Courcelle Courcelle Courcelle and Engelfriet covariance covariance covariant covariant covariant functor covariant functors covariant reduction covariant type system covariant types Coven Coven's aperiodic cellular automata cover cover of a cover of a graph cover of a string cover of an alphabeth coverability coverability coverability automaton coverability graph coverability problem coverability tree covering covering automaton covering characteristics of graphs covering digraphs covering digraphs of lattices covering grammar covering grammars covering graph covering multiplicity covering of cacti covering problem for left-recursive grammars coverings coverings of grammars covers covers of covers of polynomial ideals covers of VAS languages cover-preserving embeddings co-algebra co-algebras co-computability co-computable complement co-induction co-NEXP co-NLe co-nondeterministic co-nondeterministic decision trees co-NP co-NP complexity class co-NP language co-NP-complete co-NP-completeness co-r.e. behavior co-recurrent algorithms co-RNP-complete co-RNP-completeness co-sparse sets cp systems cp systems representation by rb grammars CPC CPC CPC*, chain complete posets and chain-*continuous maps CPI CPI CPL CPL cpo cpo cpo of intervals cpo of morphisms cpo structure on computation domains cpo's cpo's cpo's with least element cpos cpo-based semantics cpo-case cpo-completion cpo-completion of finite iterations cpo-framework cpo-semantics CPU CPU time CR crash crash failure CRCW CRCW PRAM CRCW PRAM algorithm CRCW PRAM steps CRCW-PRAM steps creation creation of processes creative set creative sets creative sets in NP CREW CREW model CREW PRAM CREW PRAM efficient parallel algorithm CREW PRAM model CRI criteria for inference criterion of success critical critical class of automata critical classes for α0 critical pair critical pair computation process critical pair lemma critical pairs critical pairs for critical pairs for graph rewriting systems critical pairs for replacement systems critical pairs for term rewriting systems critical races critical section critical suborders critical-section problem CRI-length Crochemore Crochemore Crochemore and Apostolico Crochemore and Galil Crochemore-Perrin character comparison order Crochemore-Perrin string-matching algorithm Crole Crole and Pitts Crole and Pitts FIX logical system cross cross embedded dependencies cross product crossbar crossbar DMM crossbars crossed crossed agreements crossing crossing crossing numbers crossing sequence crossing sequence argument crossing sequences crossing set game crossover crossover crossover rate cross-closed collection of sets cross-products cross-sections crowns crowns CRS CRS's cryptographic cryptographic identification cryptography cryptography cryptosystem cryptosystems cryptotext cryptotext CR-strategy cseg Csirmaz Csirmaz Csirmaz's Csirmaz's characterization of Floyd-Hoare logic CSL CSL CSL complexity class CSL transactions CSL update language CSLD CSLD-resolution CSP CSP CSP constraint satisfaction problem CSP constructs CSP language CSP language for distributed programming using communication CSP model CSP operator CSP parallel language CSP program CSP programs CSS CSS CSS plant state CSS plants CTL CTL CTL formula CTL☆ CTL-like logic CTS CTS CTS cts CTS systems CTS systems coordinated table selective substitution systems CTS's cu free propositional calculus cube cube cube dag computation cube-connected computer cube-connected-cycles network cube-free cube-free homomorphisms cube-free infinite arrays cube-free strings cube-free words cubic cubic cubic 3-connected planar graphs cubic period length cubic subgraph cubic time cubic time methods CUCH CUCH Culik Culik Culik and Dube Culik and Harju Culik II Culik II and Culik II and Karhuma¨ki Culik II and Salomaa Culik's cumulative cumulative entailments cumulative hierarchy of universes cumulative nonmonotonic entailment cumulativity cumulativity Curien Curien Curien and Berry Curien's Curien's categorical abstract machine Curry Curry Curry and Feys Curry fixed point operator Curry's Curry's functionality theory Curry's rules for assigning type schemes Curry's system Curry's type rules Curry's type rules Currying currying Currying operations currying operations Curry-Howard Curry-Howard correspondence Curry-Howard interpretation of intuitionistic linear logic Curry-Howard isomorphism Curry-Howard paradigm Curry-Howard propositions-as-types paradigm Curry-Howard terms Curry-Howard-style terms Curry-style Curry-style type-assignment system Curry-style type-inference system curve curve curved boundary curved boundary Jordan regions curves customer destruction capabilities customers customers of a queueing network customizing grammars cut cut elimination cut elimination formulas cut elimination procedure cut elimination theorem cut formulas cut free cut free LK cut free proof cut free sequent proofs cut point cut rule cut rule of transitivity cuts cuts of a graph cutting images cutting off process terms cut-elimination cut-elimination strategy cut-formulas cut-free cut-free Gentzen system cut-free LK cut-free proof cut-free propositional calculus cut-free sequent proofs cut-point cut-rule of transitivity CWA CWA cycle cycle cycle congruence cycle constructions cycle decomposition cycle decomposition of permutations cycle detection problem cycle lengths cycle sum test cycles cycles cycles of odd lengths cycle-free orders cyclic cyclic cyclic automata cyclic bandwidth cyclic computation cyclic convolution cyclic equality cyclic equivalence cyclic extended free-choice systems cyclic family of sets cyclic graph language cyclic group cyclic interpretations cyclic join dependencies cyclic languages cyclic network cyclic n-root problem cyclic ordering cyclic ordering problem cyclic rational transductions cyclic rational transductions of finite image cyclic rules cyclic schedules cyclic towers cyclic transformation semigroup cyclicity cyclicity cyclicity of groups cyclic-SCSe cyclic-SCSt cycling cycling reductions cyclomatic cyclomatic cohesion CYK CYK parsing algorithm cylinder cylinder of deterministic languages cylindric cylindric algebra cylindrical cylindrification cylindrification cylindrification operation cylindrification operator cylindrification operators c-competitive heuristic C-complexity C-edNCE grammar C-edNCE grammar sets C-edNCE sets C-edNCE sets of graphs c-expressions C-injectivity C-LAGs C-levelable set C-mos C-mos circuit designs c-systems c-systems controlled rewriting systems c-tree systolic automata D # P D # P ≠ PH D'0L D'0L languages D'0L languages D'0L systems D'0L systems D0L D0L equivalence D0L equivalence problem D0L language D0L languages D0L length sequence D0L periodicity D0L periodicity problem D0L primitivity problem D0L scheme D0L schemes D0L sequence D0L sequence equivalence D0L sequence equivalence problem D0L sequences D0L system D0L system deterministic 0L system D0L systems D0S languages D1L D1L languages D1L one-sided context language D2L languages D∞models DACTL Dactl dactl DAD DAD DAD-constraint-based specifications DAG dag dag dag directed acyclic graph dag's dag's dagger dags Dagum Dagum et al. Dahlhaus Dahlhaus and Gaifman Daisies daisy daisy daisy domains DAL DAL dangling dangling-ELSE construct DAQV DAQV Darboux Darboux curves Dassow Dassow and Ju¨rgensen data data data abstractions data alignments data alignments in parallel memory systems data allocation scheme data analysis logic with local agreement data availability data bases data capacity data collection data collection cost system data complexity data complexity of data complexity of first-order queries data complexity of querying incomplete information databases data complexity of testing containment data compression data compression algorithm data constraint data dependencies data dependency properties data directed and syntax-directed method data directed design data distribution data domain data driven data driven data flow semantics data driven reduction semantics data evolution regularities data exchange data flow data flow analysis data flow machines data flowchart schemes data flows data independent data items data locality data modeling constructs data models data movement data node data organization data organizations data refinement data replication data representation data representing processes data space data structure data structure common data structure DAWG data structure for data structure for graph embeddings data structure for lattices data structure for representation data structures data structures of bounded capacity data structures subject to insertion data structures subject to insertions data structuring data type data type constructors data type definitions data type domains data type extension problem for algebraic specifications data type extensions data type language data type representation data type specification data type specifications data type systems data types data types as initial algebras data types over multiple-valued logics data types with a dynamic component data types with exceptions database database database applications database behaviour database concurrency control database constraints database dependencies database design database graphs database language database languages database management database model database objects database programming database programming environments database programming language database queries database query languages database query optimization database relations database relationships theory database retrieval database scheme database schemes database states database storage database system database systems database terms database theory database transactions database updates database violates databases databases databases with databases with external functions databases with read and write operations dataflow dataflow dataflow analysis dataflow construction dataflow deadlock dataflow information dataflow languages dataflow networks dataflow program dataflow schemes dataflow-like model dataflow-like model of concurrent computation DATALOG Datalog Datalog datalog Datalog parallelization Datalog program Datalog program mappings Datalog programs Datalog queries Datalog semantics Datalogcirc Datalogcirc queries datastructure datatypes datatypes data-complexity data-complexity of data-complexity of querying incomplete information databases data-complexity of testing containment data-dependency properties data-directed and syntax-directed method data-driven data-driven data flow semantics data-driven reduction semantics data-movement-intensive problems data-parallel kernel language Dauchet Dauchet daughter daughter daughter cells daughter graph David Davies Davies and Schneider Davis Davis Davis-Putnam Davis-Putnam and Loveland procedure Davis-Putnam procedure DAWG DAWG DB DB-co-NP DC DC DCF DCF DCFL DCFL DCFL's DCFL's DCP DCP dcpo dcpo DDB DDB DDB's DE de Bakker de Bakker and de Bakker and de Roever de Bakker and Meertens's method de Bakker and Scott de Bakker and Zucker de Bakker et al. de Boer de Branges de Branges proof of the Bieberbach conjecture de Bruijn de Bruijn and Erdo¨s theorem de Bruijn network de Bruijn sequences De Felice De Nicola and De Nicola and Hennessy De Nicola and Hennessy's testing equivalence De Santis deadline deadline meeting properties deadlines deadlines deadlock deadlock deadlock avoidance deadlock behaviour deadlock detection deadlock detection as a directed multigraph problem deadlock in deadlock in morphisms of transition systems deadlock in timed processes deadlock languages deadlocked deadlocked executions deadlocks deadlocks deadlock-free deadlock-free implementations of processes deadlock-free morphisms deadlock-freedom dealer dealer debugging debugging debugging tools decentralized decentralized daisy chain arbiters decentralized systems decidability decidability decidability concept decidability for π-calculus equivalences decidability for chain code picture languages decidability for ET0L grammars decidability for Petri nets decidability for picture languages decidability for restricted classes of picture languages decidability for rewrite systems decidability in decidability in F-semigroups decidability in polynomial time decidability in TLA decidability of decidability of β-conversion on well-kinded types decidability of a decidability of a confluence problem decidability of a conjugacy problem decidability of a model for fair synchrony decidability of a monadic second order theory decidability of algebraicity of zeta functions decidability of an equivalence problem decidability of an equivalence problem for transducers decidability of being decidability of being a group decidability of being pure context-free decidability of boundedness decidability of boundedness of behaviour decidability of context-freeness decidability of emptiness of intersection decidability of emptyness of intersection decidability of equivalence decidability of equivalence for deterministic2-tape finite automata decidability of equivalence for erasing pattern languages decidability of equivalence for synchronized tree automata decidability of equivalence of DPDA's decidability of equivalence problem decidability of equivalence problems decidability of equivalences decidability of FIL decidability of ground reducibility decidability of k-flat PCP decidability of languages decidability of limitedness in distance decidability of local confluence decidability of membership decidability of membership in decidability of membership in linear time decidability of membership in optimal covers decidability of non-emptyness of a deque language decidability of PCP decidability of PCP(1) decidability of PCP(2) decidability of PDL decidability of permutation theories decidability of powerfreeness of morphisms decidability of primitivity decidability of process equivalences decidability of program logics decidability of reachability decidability of recognition decidability of recursion schemes decidability of regularity decidability of RTFIL decidability of slenderness of languages decidability of slimness of languages decidability of some problems in free partially commutative monoids decidability of structural equivalence of E0L grammars decidability of super-nonsingularity of DPDA's decidability of the boundedness problem decidability of the Church-Rosser property decidability of the code problem for traces decidability of the D0L equivalence problem decidability of the D0L periodicity problem decidability of the D0L primitivity problem decidability of the embedding problem for codes decidability of the equality of factors problem decidability of the equivalence problem decidability of the equivalence problem for decidability of the equivalence problem for nonerasing pattern languages decidability of the equivalence problem for partially commutative rational power series decidability of the finite power property decidability of the full monadic theory of the tree decidability of the graph of a map decidability of the HD0L sequence equivalence problem decidability of the monadic decidability of the monadic second order theory of denumerable ordinals decidability of the monadic theory of an algebraic tree decidability of the pomset-trace equivalence problem decidability of the property group decidability of the PWD0L primitivity problem decidability of the Skolem matrix emptiness problem decidability of the SUCCESS problem decidability of the validity problem decidability of the weak second order theory of any ordinal decidability of ultimate equivalence decidability of ultimate periodicity decidability of ultimate periodicity of ω-words decidability of word problems in linear time decidability of zigzag codes decidability problems decidability problems for HD0L systems with nonsingular Parikh matrices decidability problems on morphisms on monoids decidability proof decidability properties decidability questions decidability questions for picture languages decidability result decidability result for deterministicω-context-free languages decidability results decidability results for decidability results for non real time DPDA's decidability results for picture languages decidability results for recurrent words decidability results for selective substitution grammars decidability results for tree automata decidability results for wordsequence functions decidability results on infinite words decidability status of equivalence problems in form theory decidable decidable decidable ambiguity problem decidable boundedness problems decidable canonical representation decidable characterization decidable characterization of pairing decidable classes decidable classes of formulas decidable classes of Krom formulas decidable combinations of theories decidable decision problems decidable emptiness problem decidable equivalence decidable equivalence problem decidable equivalence problem for systolic E0L languages decidable equivalence problems decidable equivalences decidable equivalences for parameter-passing process calculi decidable fragments of predicate calculus decidable halting problem decidable Hoare-like logic decidable in polynomial time decidable information logics decidable logical theories decidable monadic second-order theory decidable oracle decidable parsing problem decidable problems decidable problems in free groups decidable proof concepts decidable property decidable property of D0L systems decidable quantifier-free theories decidable sentences of Church-Rosser congruences decidable sequences decidable set of constants decidable sets decidable solvability problem decidable theories decidable type inference algorithm decidable unification decidable unification problem decidable unification problems decidable word problem decidable word problems decidablility decidablility of recognition decide decidibility decidibility of the equivalence problem for deterministic pushdwon machines deciding deciding deciding bisimilarity deciding bisimulation deciding equality of sequences deciding equivalence of languages deciding fair termination deciding finite generation deciding functional equivalence deciding halting deciding hypergraph 2-colourability deciding inclusion of tree transformation classes deciding membership deciding reachability in Petri nets deciding satisfiability of equations in free groups deciding trace equivalences deciding validity decimal decipherability deciphering deciphering delay decision decision algorithm decision algorithm for SAT decision algorithms decision conditions decision diagrams decision methods decision methods for slender 0L languages decision methods in differential algebra decision problem decision problem of clause decision problem of clause implication decision problem of clause sets decision problem of first order theories decision problems decision problems for decision problems for FAM's decision problems for flow expressions decision problems for logics decision problems for Skolem decision problems for Skolem arithmetic decision problems for vector addition systems decision problems for word sequence functions decision problems of interval logic decision problems of synchronized tree automata decision problems on finite semi-Thue systems decision problems on rational relations decision problems related to protection decision problems represented by pairs of simple grammars decision procedure decision procedure calls decision procedure for decision procedure for an equivalence problem of Thue systems decision procedure for direct predicate logic decision procedure for real addition decision procedure for semi-unification decision procedure for the decision procedure for the class of regular languages decision procedure for the theory of rational numbers decision procedure for the theory of rational order decision procedures decision procedures for temporal logics of programs decision properties decision results decision rules decision theory decision tree decision tree lower bound decision tree model decision tree problem decision trees decisions decison procedure for ultimate periodicity declaration declaration declarations declarative declarative declarative higher-order language declarative interpretations declarative language declarative languages declarative modeling declarative programming declarative properties declarative semantics declarative semantics for logic programs declared correct deco deco polyominoes decoders decoders decoding decoding of double-infinite paths decomposability decomposability decomposability into shift registers decomposability of nets into finite state machines decomposable decomposable decomposable combinatorial structures decomposable net decomposition decomposition decomposition algorithm decomposition field decomposition into prime programs decomposition method decomposition method for Petri nets decomposition methods decomposition of decomposition of 2-structures decomposition of 2-structures by trees decomposition of an ideal decomposition of datalog program mappings decomposition of functional rational transductions decomposition of functional rational transductions theorem decomposition of graphs decomposition of nets decomposition of nets into sequential components decomposition of polynomial growth series decomposition of polynomials decomposition of priority relations decomposition of programming languages decomposition of semisimple Lie algebras decomposition of stochastic systems decomposition of transformation semigroups decomposition parameter decomposition theorem decomposition theorem for hyper-algebraic extensions decomposition theorem for hyper-algebraic extensions of language families decomposition theorem for hyper-algebraic extensions theory decomposition theorem for hyper-algebraic extensions theory of stochastic systems decomposition theorem for hyper-algebraic extensions tree of a graph decomposition theory for 2-structures decompositions decompositions decompositions of decompositions of automata decompositions of dense languages decompositions of linear automata decompositions of nondeterministic reductions decompositions of recognizable codes decompositions of relations decompositions of transformation semigroups decorated decorated decorated occurrence nets decorated processes decoration decoration domain decorations decoupled decoupled systems decreasing decreasing generalized Sierpinski grammars decreasingness decryption decryption key Dedekind Dedekind Dedekind cut representation Dedekind multisets Dedekind representation Dedekind's Dedekind's definition of completeness of the reals Dedekind-complete Dedekind-complete algebraic partial orders dedicated communication registers deducing deducing negative information deductibility deduction deduction deduction methods deduction methods for a language deduction problem deduction rules deduction system deduction systems deductions deductions versus terms deductios deductive deductive deductive database deductive database modules deductive databases deductive strength deductive strength of surface deduction deductive structure of join dependencies deductive system deductive system for a language for data analysis problems deductive theorem proving method deep guards default default default entailment default logic default negation default nonmonotonic entailment default notions default rules default semantics default sets default theories default translations defaults defaults in domain theory defense deferred deferred update deferring deferring repair deficiency deficiency set definability definability definability by definability by deterministic programs definability by first order formulas definability by first-order formulas definability by flowchart programs definability by iterative programs definability by monadic second-order logic definability by programs definability by programs in first order structures definability by programs in first-order structures definability by recursive programs definability in algebraically closed fields definability of definability of order definability of queues definability of the definability of the connectivity definability of the parity definability on infinite traces definability properties definable definable definable covariant functor definable evaluation definable functions over free algebras definable implicit operations definable in definable in counting monadic second-order logic definable in monadic second-order logic defined class defined datatypes defined sets defined types definedness definedness predicate defining defining equation of a recursive function defining intermediate languages defining languages defining languages via rewriting systems defining nondeterministic information defining power defining rules for synchronization definite definite abductive programs definite clause programs definite clauses definite distributed computations definite Horn clause program definite Horn clauses definite logic definite logic program definite logic programs definite program definite programs definition of definition of θ-subsumption definition of abstraction definition of average service times definition of chaos definition of control structures definition of document types definition of equivalence definition of equivalence of database schemata definition of execution method definition of finite failure definition of implementable algebra definition of implementable algebras definition of implementation definition of inclusion of database schemata definition of large transformation definition of large transformation dictionaries definition of programs definition of stability definition of subclasses definition of subsumption definition of the semantics of a nondeterministic recursive program definitions definitions of definitions of abstraction definitions of computations as ideals definitions of continuity definitions of convergence definitions of fairness definitions of functions definitions of implicit relations definitions of polynomials over arbitrary algebras definitions of sets deflations deflations deforestation deforestation deforestation transformation deformation deformation of a space in time deformations deformations Degano Degano et al. degenerate degenerate behaviors degenerate behaviour of differential equations degradation degree degree 0 degree argument degree invariant approximations degree of degree of a minimal algebra degree of accuracy degree of ambiguity degree of approximability degree of balancing degree of complexity degree of cooperation degree of fulfillment degree of growth of the ambiguity of an NFA degree of injectivity, degree of MCFL's degree of nondeterminism and degree of nonholonomy degree of nontransitivity degree of parallelism degree of path codes degree of predicate letters degree of safety degree of strict deterministic languages degree of trees degree of unsolvability degree path lengths degree restrictions on superconcentrators degree sequences degree zero degrees degrees degrees in the Grzegorczyk hierarchy degrees of degrees of ambiguity degrees of complexity degrees of freedom degrees of parallelism degrees of unsolvability degrees with infinitely many isomorphism types degree-constrained graphs degree-k k-hypergraphs Dehn Dehn's Dehn's algorithm Dejean Dejean's Dejean's conjecture Dekhtyar Dekhtyar Dekking Dekking Delaunay Delaunay Delaunay diagram Delaunay tree Delaunay triangulation delay delay delay l codes delay number delay operator delay routing delayed delayed diagonalization delaying delaying unification algorithms for lambda calculi delays delays Delcher deletability deletability deletable deleterious deleterious effect deletion deletion deletion capability of the grammars deletion closed language deletion closure of languages deletion of individual patterns deletion operations deletion strategy deletions deletions delta networks delta property Δ continuous algebras Δ02 low sets Δ02 sets Δpk Δpk language Δpk level of the polynomial hierarchy Δpk machine Δpk-immune set Δ-complete partially ordered set Δ-continuity Δ-continuity problems Δ-continuous algebra Δ-continuous algebra finitary operation Δ-continuous algebras Δ-free event structures Δ-language δ-NU system Δ-programming Δ-sums delta-languages for sets delta-semilinear Demel Demel Demlov Demlova´ demonic demonic demonic choice demonic composition demonic interpretation demonic join demonic nondeterminism demonic nondeterminism and demonic nondeterministic programs demonic operations demonic semilattice demonic union demons demons Dempster Dempster's rule Dempster-Shafer theory Dempster-Shafer theory of evidence den Boer Dennis Dennis denotation denotation denotation of a program denotation of programs denotational denotational denotational and operational semantics denotational approach to the specification problem denotational characterization denotational constructions denotational counterpart denotational definitions denotational engineering denotational equivalence denotational formulations of testing denotational interpretations denotational metalanguage denotational model denotational model of a software system denotational semantic denotational semantic model denotational semantic models denotational semantics denotational semantics as synchronization trees denotational semantics for denotational semantics for CSP denotational semantics for nondeterminism denotational semantics for programming languages denotational semantics for Prolog with cut denotational semantics in absolute logics of programs denotational semantics of denotational semantics of CSP denotational semantics of Horn sentences denotational semantics of programming languages denotational value denotations denotations denoting observation trees dense dense dense colour families dense divergence dense epis dense factorization forest dense factorization forest of finite height dense graph dense graph combinatorics dense graphs dense hierarchies of families of SBTA-languages dense languages dense maps in Pos(ω) dense matrix multiplication dense open subset dense open subsets dense orbits in languages of infinite words dense periodic orbits dense sets in PSPACE dense structures dense subset dense symmetric difference dense time densely densely computable relations densest densest hemisphere problem densities densities densities in NP densities of NP sets density density density function density function of repetition free words density of a scheduling instance density of complexity density of oracles density type results of Ladner denumerable denumerable denumerable chain of iterations denumerable unions denumerable unions of closed sets departure departure instant measure departure instant measures departure instants dependability dependability dependability measures dependable systems dependence dependence dependence alphabet dependence graphs dependence orders dependence relations dependence relations for production rules dependencies dependencies dependencies dependencies large natural class of dependencies between dependencies between control and information dependencies between program fragments dependencies formalism dependency dependency dependency forms dependency graph dependency graphs dependency graphs of partially commutative words dependency graphs of programs dependency of a function on a variable dependency relation dependency relations dependency set dependency sets dependency theory dependency-lattice dependent dependent dependent product dependent schemes dependent types depleted depleted sets depletion depletion relation depth depth depth 2 superconcentrator depth 3 circuits depth first search depth in depth in EDT0L languages depth measure depth of depth of σ-ary words depth of a depth of a comparison tree depth of a graph depth of a parallel algorithm depth of a tree depth of an implementation space depth of Boolean circuits depth of circuits depth of computation trees depth of cut-formulas depth of nested iterations depth of nesting depth of nesting of function calls depth of OWC's depth of OWCs depth of proofs depth probability generating function depth reduction technique depth restriction depths depth-2 circuits depth-3 threshold circuits of quasipolynomial weight depth-bounded translation depth-first depth-first iterative-deepening search depth-first logic programming depth-first Prolog depth-first Prolog with ground negation depth-first search depth-first-left-right strategy depth-three deterministic circuits depth-two probabilistic circuits deque deque automata deque language derandomization derandomization derandomize derandomize randomized computations derandomize randomized computations as ideals DeRemer DeRemer's DeRemer's parsing methods derivation derivation bounded grammars derivation forest derivation forests derivation in a grammar derivation lengths derivation mode derivation modes derivation of derivation of codes derivation of combinational C-mos circuit designs derivation of efficient programs derivation of programs derivation process derivation processes derivation processes in graph grammars derivation relations derivation rule derivation rules derivation sequence derivation step derivation steps derivation tree derivation trees derivation trees of an algebraic grammar derivation type derivations derivations derivations in derivations in rewriting systems derivations in toposes derivations of SLβ derivation-bounded derivation-oriented reasoning derivative derivative derivative for D0L systems derivative of Hitchcock and Park derivatives derivatives derivatives of regular expressions derivatives of words derived derived clauses derived graph derived linear derived linear system derived linear systems of context-free grammars derived operator derived preorders derived refinement operations derived relations derived set derived-operation deriving deriving deriving algorithms deriving existence deriving lower level specification deriving new computational functions from old deriving programs deriving programs from proofs of formal specifications derivor derivors Dershowitz Dershowitz Dershowitz and Lindenstrauss Dershowitz and Zaks DES DES DES controller DES discrete event system DES plant DES plant transitions DES representation descendant descendants descendants of words descending descending descending chain property descending sequence of equivalence relations describable sets describer describer describing circuit behaviour description description language description language for concurrent systems description of bases description size descriptional descriptional complexity descriptional complexity aspects descriptional complexity measure descriptional complexity of context free languages descriptional complexity of context-free languages descriptional power of PCP descriptional tool for program control descriptive descriptive complexity theory descriptive power descriptive power of nets descriptive set theory descriptive theory of learning design design decisions design factors for parallel processing benchmarks design methodology design of design of a Hoare logic design of circuits design of complete axiom systems design of distributed systems design of functional programming languages design of geometric data structures design of Helios design of logic programming languages design of loop networks design of modular systems design of modules design of optimal algorithms design of parallel programs design of programming languages design of self-stabilizing distributed algorithms design of SMS design of software systems design of systolic networks design principles design process design space for parallelism design specification of systems design systems designated designated designated point designated sets hierarchy designer designing designing efficient procedure calls designing efficient procedures designing linear classifiers designing of minimal staged networks designing programming languages designing serial algorithms designs of languages DESIR DESIR-II package desnsities desnsities in NP destroying destroying uniformity destruction destructive destructive update optimization detectable detecting detecting beta-cycles detecting degenerate behaviors detecting duplicate detecting duplicate elements detecting duplicate values detecting factorability detecting falsity of messages detecting intersections detecting possible variable values detecting unique solutions detection detection of a negative cycle detection of determinacy detection of predefinite schemes detection of repetitions detection of timing problems in digital networks deteministic determinacy determinacy determinacy of programs determinacy theorem determinacy theorem for games determinant determinant determinants determinants of matrices determinateness determinateness of program equivalence determinateness of program equivalence over Peano axioms determination of all possible codes determining determining a monotone function determining sets for functions determining the dot-depth of a star-free language determinisitic polynomial time solutions determinism determinism determinism in determinism in parallel systems determinism in PDL deterministic deterministic deterministic ω-context-free languages deterministic ω-regular deterministic ω-Turing acceptors deterministic ω-type Turing acceptors deterministic 0L system deterministic 2-tape finite automata deterministic acceptor deterministic ACT deterministic algebraic computation trees deterministic algorithm deterministic algorithm for deterministic algorithm for sorting deterministic algorithmic languages deterministic algorithmic languages without parallelism deterministic algorithms deterministic alternating Turing machines deterministic automata deterministic automaticity deterministic automaton for regular languages deterministic bidirectional variants of Chang-Roberts distributed election algorithm deterministic bidirectional variants of the Chang-Roberts distributed election theorem deterministic bottom-up deterministic bottom-up automata deterministic bottom-up parsing deterministic bottom-up tree deterministic bottom-up tree pushdown automaton deterministic bottom-up tree transformations deterministic cfl deterministic checking stack automata deterministic classes of automata deterministic communication complexity deterministic communication complexity of Boolean functions deterministic competitive ratio deterministic complexity classes deterministic computation deterministic computation models deterministic computation time deterministic computations deterministic concurrent systems deterministic context free language deterministic context free languages deterministic context-free language deterministic context-free languages deterministic control deterministic counter deterministic counter languages deterministic counter machines deterministic data flow deterministic developmental languages deterministic double exponential time deterministic equality-synchronized automata deterministic equivalences deterministic ET0L languages deterministic evaluation of a straight-line program deterministic even linear languages deterministic exponential time deterministic exponential time completeness deterministic expressions deterministic extensions deterministic extensions of Datalog deterministic extrema finding deterministic FAM's deterministic finite deterministic finite automata deterministic finite automaton deterministic finite transducer deterministic finite transducers deterministic finite turn pushdown deterministic finite turn pushdown machine deterministic finite-state machine deterministic generalized tree automata deterministic grammars deterministic graphs deterministic gsm deterministic G-machines deterministic infinite automata deterministic information deterministic information logic deterministic information systems deterministic interpretations of PD0L systems deterministic k-head finite automata deterministic k-weak counter machines deterministic language deterministic language DFP deterministic languages deterministic languages of Petri nets deterministic learning classes deterministic Lindenmayer deterministic Lindenmayer languages deterministic Lindenmayer systems deterministic linear bounded automata deterministic linear decision trees deterministic list organizing strategies deterministic lower bound deterministic LSA deterministic machines deterministic models deterministic Muller automaton deterministic multihead deterministic multihead finite automata deterministic multihead finte automata deterministic multihead multi-dimensional Turing machines deterministic multitape automata deterministic networks deterministic normal form for formulae deterministic one-tape Turing machines deterministic one-way deterministic one-way k-head finite automata deterministic one-way multitape automata deterministic oracle Turing machine deterministic parallel comparison complexity of merging deterministic PDA deterministic polynomial deterministic polynomial optimization problems deterministic polynomial space-bounded oracle machines deterministic polynomial time deterministic polynomial time algorithm deterministic polynomial time algorithms deterministic polynomial time decision procedures deterministic polynomial time for three-way context-free picture languages deterministic polynomial time log space completeness deterministic polynomial time reducibility deterministic polynomially time-bounded TM deterministic program deterministic program schemas deterministic program termination deterministic programs deterministic properties deterministic pure grammar forms deterministic pure grammars deterministic pushdown deterministic pushdown acceptor deterministic pushdown automata deterministic pushdown automaton deterministic pushdown transducer deterministic pushdown transducers deterministic rational deterministic rational equivalence relations deterministic rational expressions deterministic rational languages deterministic rational languages of two-sided infinite words deterministic rational relation deterministic recursive programs deterministic regular deterministic regular expressions deterministic regular logic deterministic restriction deterministic reversal deterministic reversal-bounded multipushdown machines deterministic rooted context-free graph deterministic root-to-frontier tree transformation classes deterministic rules deterministic schemes deterministic self-stabilizing algorithms deterministic semantics deterministic simulation deterministic simulation of tape-bounded probabilistic transducers deterministic soliton deterministic soliton automata deterministic soliton paths deterministic solutions of the nil-total exclusion problem deterministic space deterministic space bounded complexity classes deterministic space class deterministic space classes deterministic space complexity deterministic state transitions deterministic strategies deterministic strategy deterministic stream processing language deterministic sublanguages of CCP deterministic summation deterministic summation modulo a semigroup deterministic superpolynomial complexity classes deterministic synchronization deterministic synchronized deterministic synchronized alternating finite automata deterministic synchronized tree automata deterministic synchronizers deterministic synchronizing presentation deterministic system deterministic systems deterministic table 0L array sytems deterministic tape complexities deterministic tape-bounded Turing machine computations deterministic three-way tape-bounded two-dimensional Turing machines deterministic time deterministic time bounded complexity classes deterministic time classes deterministic time complexity deterministic time complexity of the equivalence problem deterministic time with nondeterministic oracles deterministic timed deterministic timed Muller automata deterministic timed processed jobs deterministic timed processes deterministic top-down look-ahead deterministic top-down tree deterministic top-down tree automata deterministic top-down tree transducers deterministic top-down tree transformations deterministic trace model deterministic transition structures deterministic tree automaton deterministic tree grammars deterministic Turing deterministic Turing machine deterministic Turing machine of specified space complexity deterministic Turing machines deterministic Turing rectangular array acceptor deterministic two way machines deterministic two-dimensional deterministic two-dimensional automata deterministic two-dimensional on-line tessellation acceptors deterministic two-tape automata deterministic two-way deterministic two-way finite state transductions deterministic two-way machines deterministic two-way tree walking look-ahead deterministic upper bound for equivalence of Presburger formulas deterministic variation schemes deterministic well-structured programs deterministic while programs deterministically deterministically identifiable deterministicw determinizing determinizing an algorithm Devaney Devaney Devaney's definition of chaos developing developing algorithms developing computational techniques developing query languages development development category development closed development of development of computational techniques development of database query languages development of efficient parallel algorithms development of large software systems development of programming semantics development of programs development of real time distributed systems development of real time systems development of real-time distributed systems development of real-time systems development of software systems development steps development system developmental languages developmental systems developmental systems theory developments of real numbers with respect to a natural number base deviation deviation theorems deviations devices devices defining languages and relations Devie DEXPTIME DEXPTIME DEXT DEXT DEXT ≠ NEXT DEXT ? NEXT Dezani DFA DFA DFA language DFA of a regular expression DFA's DFP DFS DFS dI diagnosis diagnosis of distributed computations diagnostic diagnostic diagnostic systems for industrial plants diagnostic value diagonal diagonal diagonal argument diagonal arguments diagonal continued fraction diagonal continued fractions diagonal form of a polynomial matrix diagonal function fx(x) diagonal processes diagonal sets in complexity classes diagonalization diagonalization diagonalization argument diagonalization methods diagonalization over sla inputs diagonalization over subrecursive classes diagonalization theorems on complexity classes diagonalizing diagonal-searching diagrams dialects dialgebras dialgebras diameter diameter of diameter of a spanning tree diameter of networks diameters diameters diameters of minimal graphs diamond diamond diamond property Dicky dictionaries dictionaries dictionary dictionary dictionary document dictionary order dictionary pattern matching problem dicyclicity dicyclicity of the symmetric group Diekert Diekert difference difference between 1-tape and 2-tape Turing machines difference calculus difference equations difference hierarchy of Hausdorff and Kuratowski difference operator differences differencing different than majority labelling differentiability differentiability of polynomial time computable functions differentiable differentiable function differential differential differential algebra differential equation differential equations differential fields differential Galois group differential Galois group geometric control theory differential Galois group geometry differential Galois group ideal differential invariants differential invariants of a differential equation differential operators differential polynomials differential representation of noncommutative polynomials differential systems differentially differentially differentially algebraic functions differentially stable systems differential-algebraic differential-algebraic decision methods differential-algebraic systems differential-functional equations differential-geometric property differentiation difficulties of modeling unbounded nondeterminism Diffie Diffie and Hellman message authentication problem diffuse diffuse objects diffusion digital digital automata digital controller digital curve segmentation digital data structures digital image processsing digital line segments digital networks digital nondeterminism digital nondeterminism and digital pictures digital search digital search trees digital signature digital signature method digital signatures digital sums digital topology digital tree sorting algorithm digital trees digraph digraph digraph arc geography digraphs digraphs digraph-like models Dijkstra Dijkstra Dijkstra schemes Dijkstra semi-rings Dijkstra's Dijkstra's Dijkstra's algorithm Dijkstra's dining philosophers problem Dijkstra's guarded commands Dijkstra's notion of weakest precondition Dijkstra's predicate transformer Dijkstra's requirements on guarded commands Dijkstra's wp-calculus DIL DIL dilation dilation-cost dilemma Dill Dillencourt Dillencourt et al. dimension dimension dimension of a dimension of a graph dimension of a mesh dimension of a target class dimension of graphs dimension of l-groups dimension theory dimensional dimensional dimensional components dimensions dimensions dimension-complemented dimension-complemented LAA's dimesional dinatural dinatural dinatural approach dinatural transformation dinatural transformations dinaturality dinaturality dining philosophers problem Diophantine Diophantine Diophantine equations Diophantine functions Diophantine inequations Diophantine predicates Diophantine predicates with quantifier bounds direct direct algorithm for checking equivalence of LL(k) grammars direct branching algorithm direct contact direct derivation direct derivations direct embeddings direct inductive definitions direct limit direct logic direct predicate calculus direct product direct products of automaton decidable theories direct semantics domains direct sum direct sum conjecture direct translation to nondeterministic sequential form directed directed acyclic directed acyclic graph directed acyclic graphs directed acyclic subsequence graph of a text directed acyclic word graph directed animals directed colimits directed column convex animals directed column-convex directed complete directed complete partial order directed complete partial orders directed complete relations directed complexity directed computations directed convex directed convex polyonimo directed cuts directed cycles directed graph directed graphs directed Hamiltonian circuit directed hyperedge-labelled hypergraphs directed hypergraphs directed joins directed labeled graph directed polynominoe directed set directed set of traces directed sets directed subgraph homeomorphism problem directed subsets directed trees directional directional uncertainty directionality directionality properties of an algorithm directions directions director director string calculus disabling disabling transitions disambiguating disambiguating finite transductions discarded branch discontinuum discovering sources of parallelism discovery of new concepts from data discrepancy discrete discrete discrete communicatig processes discrete computations discrete concurrent systems discrete decision theory discrete distributions discrete divergence discrete dynamical systems discrete dynamics discrete event discrete event systems literature discrete finite state automaton discrete Fourier transform discrete Fourier transform over group algebras discrete geometry discrete input symbols discrete iterations discrete Jordan theorem discrete linear time discrete logarithms modulo p discrete probabilistic models discrete processed jobs discrete processes discrete program discrete spaces discrete straight lines discrete time discrete time systems discrete transitions discrete universal neural networks discrete warehouse discrete warehouse problem discrete weight neural networks discrete-time single-server queueing system discretization discretization of geometric data discretizations discretizations discriminable discriminable set of λ terms discriminant discriminant discriminant of an algebraic system discriminant rules discriminants discriminants discrimination discrimination discrimination algorithm discrimination theorem disentailment disentailment disequality disequality disequality constraints disequality predicates disequations disequations disjoint disjoint disjoint components disjoint equational theories disjoint equivalence classes disjoint equivalences disjoint interpretations disjoint paths disjoint problem disjoint rewrite systems disjoint signatures disjoint term rewriting systems disjoint union disjoint union of disjoint union of its component categories disjoint union of term rewriting systems disjoint unions disjoint X-interpretations disjointness disjointness disjunction disjunction disjunction of equalities between variables disjunctions disjunctions of disjunctions of inequations disjunctions of quadratic monomials disjunctive disjunctive disjunctive character disjunctive components disjunctive consequences disjunctive databases disjunctive deductive databases disjunctive definition disjunctive form disjunctive information disjunctive languages disjunctive logic disjunctive logic program disjunctive logic programs disjunctive normal form disjunctive normal form propositional calculus tautologies disjunctive reducibility disjunctive unfolding disjunctively disk disks disks disorder disparity dispatch displacements display-map categories disprove inductive conjectures dissemination dissidence dissidence relation dissolution dissolution technology distance distance distance automata distance between KUM's distance function on a finite automaton distance functions for string-matching distance metric distances distances distance-hereditary graphs distinct distinct connection class distinct connection classes distinct members distinct objects distinctness distinguished distinguished node distinguished transition in Petri nets distinguishing distinguishing distinguishing factors distinguishing polynomials distributed distributed distributed 1-solvable tasks distributed algorithm distributed algorithms distributed algorithms for complete networks of processors distributed algorithms in synchronous broadcasting networks distributed array distributed array query and visualization distributed array query and visualization framework distributed array server distributed arrays distributed aspects distributed bisimulations distributed catenation distributed computation distributed computation model distributed computations distributed computations as ideals distributed computing distributed computing agent distributed computing facilities distributed control distributed control problems distributed data distributed data base distributed data structures distributed database distributed database system distributed database systems distributed databases distributed definite clause programs distributed derivations distributed environment distributed executions distributed job scheduling distributed K-selection problem distributed leader finding distributed loop network distributed memory distributed memory machine distributed memory machines distributed memory model distributed model distributed nature distributed parallelism distributed processes distributed programming distributed quorum consensus method distributed real-time system distributed refutations distributed scheduling problem distributed selection distributed selection algorithm distributed sorting distributed sorting algorithms distributed system distributed system implementations distributed systems distributed systems design distributed systems modelization distributed task distributed termination detection problem distributed-memory machines distributing distributing distributing global control goals distributing the address space among memory modules distribution distribution of distribution of access probabilities distribution of Boolean operators distribution of insertion costs distribution of jobs in equilibrium distribution of prime distribution of primes distribution of primes in arithmetic sequences distribution of SAT solutions distribution of search cost distribution of vertex degrees distribution on the set of instances distribution problem distributional distributional distributional communication complexity distributional complexity distributional complexity of disjointness distributional NP problems distributions distributions distributions of distributions of black tokens distributions of random variables distributions of the weights of codes distribution-free distributive distributive distributive categorical setting distributive categorical set-theoretic/algebraic characterizations distributive category distributive computability distributive environment transformer distributive graph distributive lattice distributive lattices distributive semantics distributive semantics for nondeterministic typed λ-calculi distributive stable L-domains distributive structures distributively distributively computable functions distributivity distributivity distributivity assumption distributivity of application distributivity of application with respect to union distributivity over nondeterministic choice disturbance disturbances disunification disunification disunification problems divergence divergence divergence and divergence and boundedness of computations divergence and readiness semantics of Olderog and Hoare divergence decision problem divergence free divergence in timed processes divergence of computations as ideals divergence of F≤ type checking divergence preserving bisimilarities divergent divergent divergent completion processes divergent computations diverging diverging judgement divide-and-conquer divide-and-conquer algorithms divide-and-conquer implementation divide-and-conquer methods dividing computational problems divisibility divisibility of divisibility of partially commutative polynomials divisibility of sparse binary numbers divisibility problem divisibility problem for polynomials divisibility problem in algebra divisibility properties of divisibility properties of polynomials divisibility properties of sparse polynomials division division division algorithm for partially commutative polynomials division of cells division operation division operator division problem for N-rational formal power series division ring division sequences divisions divisor divisors divsion divsion algorithm dI-domain dI-domains DL DL dl DL = NL DL = P DLOG DLOG class of languages DLOGTIME DLOGTIME DLOGTIME-reductions DLP DLP DLP specification language DMM DMM DMMs DNA DNA DNA sequence DNA sequences DNA sequencing DNF DNF formulas DNF representations doacross doacross document document document processing document processors document structure document types document use documents Dolev Dolev Dolev and Yao Dolev et al. domain domain closure domain closure assumption domain closure condition domain constructions domain decomposition domain decomposition problem domain element domain equation domain equations domain in the sense of Scott domain knowledge domain of domain of a λ model domain of a data base domain of an interpretation domain of histories domain of infinitary domain of infinite traces domain of infinite trees domain of input/output histories domain of interpretation domain of natural numbers domain of nontermination domain of retraction domain of symbolic evaluation domain of symbolic expressions domain of the node cover problem domain products domain representability domain size domain structure domain theory domains domains defined by simultaneous recursion domains equation domains for domains for concurrency domains for logic programming domains in semantics domains of domains of continuously generated fixed points domains of cpo's domains of elements domains of graph problems domains of hereditarily finite nested domains of hereditarily finite nested lists domains of hereditarily finite nested sets domains of histories domains of infinitary domains of infinitary languages domains of information domains of interpretations domains of morphisms domains of natural transformations domains of parameters domains of partial descriptions domains of programs domains of real functions domains of retractions domains of semantics domains with deflations domain-closure axioms domain-independent domain-independent database domain-independent formulas domain-independent queries domain-theoretic domain-theoretic framework domain-theoretic proofs of Banach's fixed point theorem domain-theoretical constructor-sharing domain-theoretical constructs domain-theory dominance dominance dominance for vectors dominance ordering dominance problems dominant dominant root dominating dominating clique dominating clique problem dominating set dominating set problem dominating spaces domination domination domination for graphs domination games domination of a language domination problems domineering domineering domineering games domineering position domineering snake positions domino domino domino game domino problems domino snake problems domino tiling domino types dominoes dominoes over a free monoid Donell Donos Donos Dorst Dorst-Smeulders parametrization of digital line segments Doshita Doshita and Yamasaki dota dota's dot-depth dot-depth hierarchy dot-depth of a star-free language dot-depth of monoids dot-depth two dot-depth-one language recognition dot-products double double characterization of slices double coset membership double diagonalization double pushout double pushout algebraic graph rewriting double pushout approach double pushout construction double pushout graph rewriting double rotations double stochastic tree automaton double Stone algebras double z-factorization double-dipping double-dipping pair double-dipping property double-infinite paths double-pushout double-pushout framework double-pushout transformation rule double-pushout transformations double-pushouts doubly doubly exponential blow-up doubly infinite word doubly linked doubly linked lists doubly linked loop networks doubly noncircular AG's downward downward closure downward closure conditions downward Lo¨wenheim-Skolem theorem downward theorem downward translations downward translations of equality downwards downwards accumulations on trees downwards passes down-set dP dP grammar dP grammar deterministic pure grammar dP grammar forms DPA DPA's DPDA DPDA DPDA's DPDA's DPDA's in atomic normal form DRn look-ahead drawing drawing drawing graphs drawing partial orders drawings drinking glasses game dropping of type-statement premises DS DSC DSC DSPACE DSPACE DST DT DT0L functions DT0L languages for distributed programming DT0L system DT0L systems DT0L-langages DTA DTA DTA's DTC DTC DTIME DTIME DTM DTM DTM models DTML DTML DU DU dual dual dual automaton dual characterization of I-relations dual graph dual monotonic language learning dual monotonicity dual of dual of a Hopf algebra dual of behavior relations dual of cumulativity dual of dependency dual of equipotence dual of realization relations dual of the dual of the class of saturated sets dual of the completion relation dual of the dissidence relation dual of the Melas code dual operation dual problem to least fixed points dual problems dual relation dual return complexities dual return complexity classes dual return complexity classes of nondeterministic Turing machines dual structure of nondecomposable sets dual weak-monotonic learning dualities dualities between sublanguages duality duality duality between duality between algebras and frames duality between optimum search trees and minimum weight partitions duality between search tress and partitions duality between the category of modal algebras and the category of descriptive modal frames duality of abduction duality of the modal μ-calculus duality of topological spaces and observation frames dually dually chordal graphs duals duals of duals of plane graphs duals of polyhedra Dube Dube and Culik Dubuc Dubuc and Street Duchamp Duchamp and Thibon Dudeney Dudeney Dulucq Dulucq and Gouyou-Beauchamps dumps Dung Dung's grounded argumentation semantics duplicate-freeness duplication duplicator duplicator duration calculus duration of service duration properties durations duration-unknown task scheduling problem of Cole and Vishkin Duris Duris and Galil Dushnik Dushnik-Miller dimension Dushnik-Miller dimension of partially ordered sets Duval Duval DX Dyck Dyck language Dyck languages Dyck paths Dyck reduction Dyck set Dyck word Dyck-reduction Dymond Dymond and Tompa dynamic dynamic dynamic adequacy dynamic algebraic dependencies dynamic algebras dynamic algorithms dynamic atomicity dynamic behavior dynamic behaviour dynamic behaviour of dynamic behaviour of a database dynamic behaviour of automata networks dynamic behaviour of finite automata networks dynamic binding dynamic clauses control operators dynamic constraints dynamic control dynamic control of dependable systems dynamic creation of processes dynamic data structure dynamic database behaviour dynamic decision rules dynamic detection dynamic dictionary matching dynamic embedding of X-trees into arrays dynamic embeddings among arrays dynamic environment dynamic errors dynamic evolution dynamic graph problems dynamic integrity dynamic integrity constraint dynamic integrity constraints dynamic Kahn networks dynamic labeled 2-structures dynamic language dynamic logic dynamic logic of type d dynamic logics dynamic maintenance dynamic maintenance of directed hypergraphs dynamic modelization dynamic nondeterministic networks dynamic optimization dynamic placement of resources in a tree dynamic planar point location dynamic predicate logic dynamic problems dynamic programming dynamic programming algorithms dynamic programming membership dynamic programming membership algorithm dynamic programming problems dynamic programming routines dynamic programming solutions dynamic programming with precomputation dynamic properties dynamic properties of machines dynamic reachability dynamic reconfiguration dynamic reconfiguration ability dynamic reconfigurations dynamic relational semantics dynamic scheduling dynamic secret sharing schemes dynamic self-stabilizing networks dynamic semantics dynamic storage dynamic storage allocation dynamic storage needs dynamic structures dynamic subset dynamic systems dynamic task-parallel programs dynamic theories dynamic typing dynamical dynamical dynamical behavior dynamical behaviour of Coven's aperiodic cellular automata dynamical characteristics dynamical laws dynamical properties dynamical subsets of the Rauzy fractal dynamical system dynamical system associated to a QAT dynamical systems dynamical systems associated to the Rauzy substitutions dynamically dynamically dynamically reconfigurable optical networks dynamically scheduled processors dynamically specified map dynamically varying data structures dynamics dynamics dynamics of dynamics of chip firing games dynamics of equivalence relations dynamics of positive automata networks dynamics of super Turing theories dynamics of the continued fraction transformation dynamic-data types d-ary logic d-bounded orientation D-categories D-classes in monoids d-code D-continuity D-continuous causal nets d-dimensional d-dimensional Euclidean space d-dimensional k-tape Turing machines d-dimensional meshes d-dimensional space d-dimensional tapes d-self-reducibility D-structuredness d-trapezoid graphs E ≠ NE E0L E0L family E0L form E0L forms E0L grammars E0L language E0L languages E0L rewriting E0L system E0L systems E0L-E0L array E0L-E0L array languages E0L-E0L array system E0L-languages E0L-unambiguous E0S system E2 PROM type memories eager eager computation eager variable elimination ear ear ear decomposition search ear label Earley Earley algorithm on parsing Earley's Earley's recognition algorithm earliest early bisimulation equivalence ears easiest hard problems easy easy sets easy subset Ebbinghaus Ebbinghaus ECTL ECTL Edelsbrunner Edelsbrunner et al. edge edge colouring edge colouring of graphs edge colouring planar graphs edge dilation edge disjoint edge disjoint cycles edge disjoint perfect matchings edge failures edge geography edge labelings edge labelings for trees edge of chaos edge recoveries edge replacement edge replacement graph grammars edge replacement systems edge separators edge weighted trees edges edges edge-colored edge-colored graph edge-colored hypergraph edge-colouring edge-colouring indifference graphs edge-colouring outerplanar graphs edge-covering characteristics of graphs edge-disjoint edge-disjoint forests edge-disjoint paths edge-labeled graphs edit distance edit distance based string-matching edit problem edNCE EDS EDS EDT EDT0L languages EDT0L systems EFD EFD0L languages effect of alternation effect of indexes effective effective ω-rule effective abstract complexity theory effective automatic test generation effective characterization of squarefree morphisms effective closure properties effective compilation effective composition effective computable neccessary conditions for equivalence of c.f. grammars effective cpo effective decidability effective domains effective findability effective findability of zeros effective form of the classical zero-one law effective hierarchy effective inference systems effective infinitary logic formulas effective interpretations effective measure zero effective methods effective namings effective objects effective operators effective preservation of recognizability effective programming system effective proof systems for temporal logic effective query effective regularity of the sets of subwords effective representation effective solution effective stratification effective subdirect decomposition effective synthesis effective test generation effective topos effective variations of the Ehrenfeucht conjecture effective version of the Baire category theorem effectively computable functions effectively computable functions of power algebras of sets effectively computable semilinear effectively computable semilinear reachability sets effectively computable semilinear set effectively computable semilinear sets effectively computable subset effectively constructible semilinear Parikh maps effectively decidable effectively given effectively given congruence relations effectively given domain effectively given domains effectively given spaces effectively stratifiable effectively stratifiable logic programs effectively stratifiable programs effectiveness effectiveness effectiveness aspects effectivity effectivity effects of noise effects of nondeterminism on intractability effects of nondeterminism on intractibility efficacy efficiency efficiency efficiency formula efficiency of efficiency of a proof method efficiency of algorithms efficiency of data organizations efficiency of functional programs efficiency of large-size applications efficient efficient algorithm efficient algorithm for planarity-testing efficient algorithms efficient algorithms for finding transversals efficient algorithms for implementing addition of real numbers efficient augmentation efficient bottom-up evaluation efficient bottom-up multi-pattern matching efficient bounds efficient compilation efficient complementation efficient computability efficient construction efficient CRCW-PRAM algorithms efficient decidability efficient delay routing efficient downward pass efficient dynamic solutions efficient effective solution efficient encoding efficient encoding of posets efficient encoding of posets, efficient encodings efficient evaluation efficient evaluations of expressions efficient execution efficient general-purpose parallel computer efficient implementations efficient implementations of optimal complexity efficient induction mechanisms efficient learning efficient learning algorithm efficient model checker efficient models efficient monotone solutions efficient Monte Carlo primality test efficient parallel efficient parallel algorithm efficient parallel algorithms efficient parallel computations efficient parallel solutions efficient parallelization efficient programs efficient recognition of transductions efficient recognition of transductions and relations efficient representations efficient sampling efficient sampling algorithms efficient sampling strategies efficient scheduling of tasks efficient simulations efficient solution efficient solutions efficient space-bounded TM simulations efficient string matching efficient string matching algorithms efficient time-bounded ATM efficiently identifiable language EFS EFS EFSs EFSs Eggan Eggan Egli Egli-Milner ordering Egli-Milner's order Ehrenfelt Ehrenfencht games Ehrenfeucht Ehrenfeucht Ehrenfeucht and Ehrenfeucht and Mycielski Ehrenfeucht and Rozenberg Ehrenfeucht conjecture Ehrenfeucht et al. Ehrenfeucht's Ehrenfeucht's conjecture Ehrenfeucht's conjecture from Hilbert's basis theorem Ehrenfeucht-Fraa¨sse´ Ehrenfeucht-Fraa¨sse´ game on graphs Ehrenfeucht-Fraa¨sse´ games Ehrhard Ehrhard Ehrhard's Ehrhard's D-categories Ehrig Ehrig's rewriting system eigenvalue eigenvalue eigenvalue problem eigenvalues eigenvalues of eigenvalues of northwest corner truncations eigenvalues of north-west corner truncations eigenvalues of Parikh matrices eigenvalues of sparse matrices Eilenberg Eilenberg Eilenberg equality theorem Eilenberg's Eilenberg's cross-section theorem Eilenberg's equality theorem Eilenberg's open problems Eilenberg's theory of varieties Eilenberg-Moore categories of algebras ELP, &Sigma2 election election of a leader in a ring election theorem ELECTRE ELECTRE ELECTRE language ELECTRE programs ELECTRE reactive language ELECTRE real-time language electrical electrical behaviour elegant algorithm elegant family of languages element element distinctness elementary elementary arithmetic elementary asymptotic solutions elementary category theory elementary cellular automata elementary codes elementary combinatorial problems elementary components elementary constructions elementary D0L systems elementary decidability elementary disjunction elementary formal system elementary formal systems elementary formal systems elementary functions elementary geometric problems elementary graph languages elementary homomorphisms elementary matrices elementary models elementary morphisms elementary net elementary net system model elementary net systems elementary path elementary pattern codes elementary rectangles elementary recursive elementary recursive class elementary recursive procedure elementary recursive set elementary recursive sets elementary relations elementary set-theoretical model elementary symmetric elementary symmetric functions elementary symmetric polynomials elementary theory of elementary theory of Boolean algebras elementary theory of higher-order universal algebra elementary theory of the category of sets elementary topos elementary transition systems elements elements of regular languages elements of semimodular lattices elements of universal types Elgot Elgot Elgot and Mezei Elgot's Elgot's CACI eliminant eliminant eliminating eliminating left recursion eliminating nondeterminism eliminating nondeterminism from Turing machines elimination elimination elimination of elimination of cylindrification elimination of iteration quantifiers elimination of nondeterminism elimination of null productions elimination of the cut-rule of transitivity from the subtype relation elimination operators elimination ordering elimination ordering of the vertices of the graph elimination rule ellipsoid ellipsoid method ELT1 ELT1 class of languages embeddability embeddability embeddability of graphs embeddability problems of graphs embeddable embeddable embeddable graph embeddable in an adjunction embedded embedded embedded Crole and Pitts embedded dependencies embedded functional dependencies embedded implications embedded join dependencies embedded lattices of global states embedded multivalued dependencies embedded planar graph embedded subarrays embedding embedding embedding actions embedding algebra embedding graphs into topological surfaces embedding mechanism embedding mechanisms for graph grammars embedding method embedding metric spaces embedding monoids in groups embedding of ECTL embedding of X-trees embedding of X-trees into arrays embedding orders embedding orders in a grid embedding problem embedding problem for codes embedding relations in predicate transformers embedding theorem embedding trees in lines embeddings embeddings embeddings of embeddings of a monoid into a free algebra embeddings of binary trees embeddings of binary trees in lines embeddings of monoids embedding-projection pairing embedding-projection pairs Emden Emerson Emerson and Emerson and Jutla Emerson and Lei Emiris Emiris and Canny EML EML EML extended ML EML extension of ML EML language EML programs empirical empirical empirical behavior empirical evidence emptiness emptiness emptiness of intersection emptiness problem emptiness problem for timed Bu¨chi automata empty empty empty and redistribute game empty and transfer game empty channel detection empty clause empty process empty proposition empty relation empty word emptyness empty-all-but-one game empty-carrier problem EMRM EMRM emulating emulating random walk emulations EN EN system enabled enabled section enabledness encasement encasement eNCE eNCE eNCE families of eNCE families of graph languages eNCE families of languages eNCE graph eNCE graph grammar eNCE graph grammars eNCE graph language encode encode encode records encodement encoding encoding encoding a graph into another one encoding arrays into trees encoding digital data encoding graphs encoding inequalities as equalities encoding of posets encoding ordered trees encoding posets encoding scheme encoding schemes encoding the encoding the computation of an alternating TM into a logical theory encoding the shape of an object into a gene encodings encodings encryption end variable endedness endgame endgame positions in the game of Go endmarking endmarking endofunctions endofunctions endofunctor endofunctor endofunctors endofunctors endomorphism endomorphism endomorphism of a free semigroup endomorphism of monoids endomorphisms endomorphisms of endomorphisms of free monoids endomorphisms of monoids end-to-end delay energy function enforceable enforceable by diagonalization enforcement enforcement enforcing enforcing termination Engeler Engeler Engeler's Engeler's generalization of Galois theory Engelfriet Engelfriet Engelfriet and Courcelle Engelfriet et al. engine engineering systems enhanced enhanced instruction sets enhanced RAM's enlarged probability space eNLC eNLC families of languages enough points enriched enriched enriched categories enriched category enriching enriching signatures enrichment enrichment enrichments ensemble entailment entailment entailment between specifications entailment relation entailment requirements entailments entailment-based actions entire entire system of equations over an alphabeth entire systems entropies entropy entropy entropy of entropy of a entropy of a language entropy of a text entropy of contact circuits entropy of networks entropy of one counter languages entropy of submonoids entropy reduction game entropy-preserving embeddings entry-exit specifications enumerable enumerable enumerable assertions enumerable by iteration enumerable complexity enumerable equational theory enumerable languages enumerable sequence enumerable sequence of recursive machine running times enumerable set enumerable subset enumerating enumerating enumerating embeddings of graphs enumerating higher-order E-unifiers enumerating procedure enumerating reliable axioms enumerating series enumeration enumeration enumeration dags enumeration formula enumeration method for languages enumeration methods in permutations enumeration of enumeration of all minimal separators in a graph enumeration of families of nodes enumeration of families of trees enumeration of generalized Young Tableaux enumeration of graphs enumeration of graphs and maps enumeration of nodes in trees enumeration of polynominoes enumeration of polyominoes enumeration of substrings enumeration of success patterns enumeration problems enumerations enumerative enumerative enumerative combinatorics enumerative series envelope enveloping enveloping algebras enveloping algebras of Lie algebras environment environment environment actions environment machine environment machines environment transformer environments environments EOL EOL rewriting EON EON+μ EP EP EP class of algorithms epis epis epistemic epistemic logic ε-approximations ε-free ε-general L-theorem ε-general theorems ε-substitutions ε-transitions epsilon epsilon-ball topology epsilon-free finite substitution EPT EPT0L languages equal computational capability equal conflict equal conflict net systems equal conflict systems equalities equalities between rational equalities between rational K-subsets equality equality equality atoms equality collector of two homomorphisms equality collectors equality conditions equality language equality of equality of elements equality of factors problem equality of multiplicity equality of multiplicity sets of regular languages equality predicate symbol equality problem equality problem for equality problem for deterministic pushdown equality problem for DPA's equality problem for Petri nets equality problem for reachability sets equality problem for reachable sets equality problem for sets of firing sequences equality problem for vector addition systems equality relation equality rule equality rule problem equality sets equality sets of finite sets of homomorphisms equality test equality-generating dependencies equality-synchronized automata equality-test equality-test algebra equality-test data types equalizers equalizers in a Cartesian closed category equal-level predicate equates equation equational equational equational λ-calculus-theory equational abstract data type specifications equational algebraic laws equational axiom definitions of data abstractions equational axiom systems equational axiomatization of systolic systems equational axioms equational axioms of iteration theories equational calculus equational case equational classes equational clauses equational completion equational completion in order-sorted algebras equational completion procedures equational dataflow language equational deduction equational deduction of exceptions equational definability equational definition equational definitions of functions equational formal systems equational Horn programs equational hypergraphs equational inference system equational languages equational laws equational laws for bisimulation equivalence equational logic equational logic languages equational logic of fixed points equational logic programming equational normal forms equational normal forms of rational schemes equational preference principle equational process theory equational programming equational programming in λ-calculus equational programming language equational proofs equational properties equational properties of equational properties of fixed points equational properties of iteration equational properties of Kleene algebras equational properties of the equational properties of the fixed point operation equational properties of the fixed-point operation equational reasoning equational rewriting equational rewriting systems equational sets equational specification equational specification of partial higher-order algebras equational specifications equational subsets of general algebras equational techniques equational term rewriting systems equational theories equational theory equational theory of equational theory of pomsets equational theory of sets equational type logic equationally equationally equationally defined data equationally defined data abstractions equationally defined data algebra equationally defined data algebras equationally equivalent equationally specified equationaly equations equations equations for regular languages equations for streams equations in free groups equations in monoids with constants equations in semigroups equations in the λ-calculus equations valid in initional models equations with operators for languages equicontinuous equicontinuous equicontinuous points equilateral equilibria equilibria in games equilibrium equilibrium equilibrium configuration equilibrium state equilibrium state probabilities equilibrium state probability distribution equilibrium state probability distributions equipotence equipotence relation equivalence equivalence equivalence between equivalence between blocks equivalence between Choueka automata and Wojciechowski automata equivalence between database schemata equivalence between program schemas equivalence between rational and recognizable series equivalence between relational database schemata equivalence between temporal logic and star-free languages on infinite words equivalence checking algorithm for grammars equivalence checking family of languages for LL(k) grammars equivalence class equivalence class of equivalence class of Scott-continuous functions equivalence class of terms equivalence classes equivalence classes of equivalence classes of computation sequences equivalence classes of conditional traces equivalence classes of finite computation sequences equivalence classes of optimal algorithms equivalence classes of types in the BCD-system equivalence decision problem equivalence defined by refusal testing equivalence in equivalence in second-order predicate calculus equivalence in the DCP model equivalence kernels of equivalence kernels of rational functions equivalence kernels of subsequential functions equivalence kernels of susequential functions equivalence of equivalence of λ-terms equivalence of algorithms equivalence of APDA's and ACFG's equivalence of batteries of tests equivalence of c.f. grammars equivalence of communication structures equivalence of computational networks equivalence of computations as ideals equivalence of concurrent systems equivalence of constraint systems equivalence of deteministic pushdown automata equivalence of deterministic equivalence of deterministic finite turn pushdown machines equivalence of deterministic pushdown equivalence of deterministic pushdown transducers equivalence of DPDA's equivalence of E0L grammars equivalence of families of DPDA's equivalence of finite automata over semirings equivalence of grammars equivalence of infinite behavior equivalence of infinite behaviors equivalence of Kripke structures equivalence of LL(k) grammars equivalence of machines equivalence of maximality and completeness equivalence of multiplication algorithms equivalence of multitape finite automata equivalence of multi-process algorithms equivalence of networks equivalence of optimization problems equivalence of polynomial-time programs and polynomial-time circuits equivalence of Presburger formulas equivalence of processes equivalence of program schemes equivalence of programs equivalence of rational transductions equivalence of reachability sets equivalence of recursive program schemes equivalence of regular languages equivalence of representations equivalence of specification languages equivalence of strict deterministic vs LL(k) grammars equivalence of systems equivalence of term rewriting systems equivalence of transducers equivalence of tree languages equivalence of universality and determinism equivalence of words equivalence problem equivalence problem for equivalence problem for arithmetic expressions equivalence problem for attribute systems equivalence problem for automata equivalence problem for bounded grammar families equivalence problem for context free tree grammars equivalence problem for context-free equivalence problem for context-free languages equivalence problem for context-free tree grammars equivalence problem for deterministic 2-tape finite automata equivalence problem for devices defining languages and relations equivalence problem for DPDA equivalence problem for DPDA's equivalence problem for E-pattern languages equivalence problem for finite valued finite transducers equivalence problem for HD0L sequences equivalence problem for linear s-grammars equivalence problem for LL(1) grammars equivalence problem for multicounter machines equivalence problem for nonsingular automata equivalence problem for partially commutative rational power series equivalence problem for Presburger sets equivalence problem for regular equivalence problem for regular almost-confluent Thue systems equivalence problem for regular expressions with interleaving equivalence problem for regular preperfect equivalence problem for regular preperfect systems equivalence problem for regular Thue systems equivalence problem for semilinear sets equivalence problem for simple equivalence problem for simple languages equivalence problem for transducers equivalence problem for tree grammars equivalence problem for vector addition systems equivalence problem modulo a finite set equivalence problem of equivalence problem of compositions of morphisms equivalence problem of inverses equivalence problem of inverses of single-valued rational transductions equivalence problem of languages equivalence problem of rational transductions equivalence problem of single-valued rational transductions equivalence problemfor simple languages~ equivalence problems equivalence problems for equivalence problems for multiplicity equivalence problems for multiplicity sets of regular languages equivalence problems for picture languages equivalence problems for URE equivalence problems in form theory equivalence problems of the composition of morphisms equivalence proof of operational and denotational semantics equivalence proofs for open expressions equivalence queries equivalence relation equivalence relation for equivalence relation for batteries of tests equivalence relation for finite computation sequences equivalence relation semantics equivalence relations equivalence relations in automata networks equivalence relations on automata equivalence result between two semantics equivalence results equivalence results among reducibilities equivalence results on polynomial time reducibilities equivalence rules for Prolog programs equivalence theorem between theories equivalence to effective operators equivalence transformation rules equivalence with respect to stuttering equivalences equivalences equivalences as congruences equivalences between concurrency and nondeterminism equivalences between rational and recognizable series, equivalences for processes equivalences of equivalences of finite valued transducers equivalences of programs equivalences of rational transductions equivalences of regular systems equivalences of semantics equivalences of transition systems equivalences of universality and determinism equivalences on transition systems equivalence-preserving first-order unfold/fold equivalence-provable equivalent equivalent equivalent character comparison orders equivalent D0L systems equivalent finite automata equivalent finite canonical system equivalent grammars equivalent programs equivalent semantic models equivalent states of an LTS equivalent subsystem equivalent transformations erasable erasable families of languages eraser eraser Turing eraser Turing machine class eraser Turing machine classes eraser Turing machines erasing erasing erasing pattern languages erasing productions erasure erasure of finite symbols homomorphisms ERCW ERCW PRAM ERCW PRAM exclusive read concurrent write PRAM Erd Erdo¨s ERE ERE ERE's ERE's EREW EREW model EREW PRAM EREW PRAM algorithms EREW PRAM parallel random access machine without read and write conflicts ergodic ergodic ergodic aperiodic endomorphism ergodic interpretations ergodic languages ergodic properties ergodic properties of DCF ergodic properties of Minkowski's diagonal continued fraction ergodic representation ergodic representation of a finite automaton ergodic rule ergodic subsystems ergodicity erratic erratic nondeterminism erroneous erroneous answers erroneous copies erroneous input erroneous loops in programs error error bound error bounds error correcting power error correcting power of pluralism in BC-type inductive inference error handling error indication error introduction error measures error messages error probability error probability in factoring error probability of primality tests error propagation error recovery error recovery routines error tolerance error weights errors errors in string matching errors of probabilistic computation errors versus exceptions error-correcting codes error-probability Ershov Ershov numerations Ershov's Ershov's mixed computation Ershov's mixed computation model escape mechanisms ESPACE ESPACE essential intersection type assignment system ESTELLE ESTELLE Estelle ESTELLE language ESTELLE specifications Estelle specifications estimated maximal number estimation estimation estimation algorithm estimation of stochastic systems estimations estimators estimators ET0L ET0L forms ET0L grammars ET0L languages ET0L languages depth in EDT0L languages ET0L systems eta rules η-distinct forms η-expansions η-infinite expansion ethological ethological theories of Merzenich and Kaas Euclid Euclid's greatest common divisor algorithm Euclidean Euclidean Euclidean algorithm Euclidean algorithm for the computation of GCD's Euclidean geometry Euclidean long division scheme Euclidean norm of real vectors Euclidean plane Euclidean real line Euclidean space Euclidean spaces Euclidean traveling salesman problem Euclidian Euler Euler Euler characteristics Euler function Euler identities Euler path Euler's Euler's gamma function Eulerian Eulerian statistic Euler-Poincare´ characteristic eureka eureka definitions evaluated meanings evaluating evaluating arithmetic expressions evaluating even functionals evaluating expressions evaluating expressions in fixpoint calculi evaluating integers evaluating interpolation polynomials evaluating polynomials evaluating scheduling strategies evaluation evaluation algorithm evaluation algorithms evaluation approaches evaluation by rewriting evaluation costs evaluation family of languages evaluation function of an abstract machine evaluation in evaluation in Martin-Lo¨f type theory evaluation in parallel evaluation of evaluation of λ-calculus evaluation of a straight line program evaluation of arithmetic circuits evaluation of circuits over lattices evaluation of expressions evaluation of fixpoint expressions evaluation of functions evaluation of integers evaluation of integers and polynomials evaluation of linear recurrences evaluation of logical functions evaluation of polynomials evaluation of primal grammars evaluation of substitution variables evaluation of the inverse of a matrix evaluation order evaluation points evaluation procedure evaluation rules evaluation strategies evaluation strategies for concurrent languages evaluation strategy evaluation transform evaluations evaluations evaluator evaluators Even Even and Tarjan even linear even linear grammars even linear languages event event event automata event domains event expressions event occurrence event oriented concurrent systems event set event structure event structure isomorphism event structure semantics event structures event structures admitting events events events of events of causal nets events of dot-depth one eventuality properties eventually periodic event-based event-based formalism event-based protocols event-controlled components event-driven event-oriented event-structures evidence evidence theory evil evil scheduler evolution evolution evolution laws evolution of evolution of coloured spaces evolution of n-segments evolutionary evolutionary sites exact exact algorithms exact asymptotic value exact characterization exact clocks exact computation sequences exact computation sequences for axiom systems exact congruence exact congruence between definitions exact counting problem exact cover by 3 sets problem exact explicit calculation exact expressions exact identifiability exact learnability exact learning exact order exact relationships exact shortest distance exact solutions exact threshold exact trade-offs exact values exactly uniform generation of efficiently verifiable combinatorial structures exactness exactness examination examination of I-relations exceedance exception exception algebras exception handling exception handling in algebraic specifications exception labelling exception lists exception recovery exception recovery policy exceptional exceptional behaviour exceptional values exceptions exchange of exchange of agents exchange of names exchanged information exchanges exchanges of three intervals exciting developments excluded excluded middle exclusive read exclusive read concurrent write PRAM exclusive write privileges excursion executability executability executability problems executable executable executable codes executable operations executable PRS's executable SML program executable state sequence executable structure executable temporal logic system execute-as-much-as-possible-in-parallel semantics executing execution execution methods execution model execution of a process execution of complete binary trees execution of operations execution phase execution sequence execution sequences execution time execution time distributions execution times execution trees executions executions of executions of algorithms executions of programs execution-time ∃∀∃-formula existence existence of existence of a semigroup with unsolvable word probelm existence of acyclic directed graphs existence of an inaccesible cardinal axiom existence of colimits existence of fixed points existence of fixpoints of functions existence of free and initial models existence of home states existence of indexings existence of limits existence of one-way functions existence of recursive sets existence of refinement mappings existence of relativized polynomial-time hierarchies existence of terminal coalgebras existence of topological upper bounds existence of universal Turing machines existence problems existence property existence theorem of pushout-complements existence theorems existential existential existential and universal partial correctness existential configurations existential elimination rule existential equalities in partial algebras existential equivalence existential formulas existential fragments existential partial correctness existential quantification existential quantifier existential quantifier of TLA existential query existential second order logic existential second-order logic existential states existential theory of Abelian l-groups existential theory of nontrivial Abelian l-groups existential types existential variable existentially existentially quantified conditions existentials EXIT exit exit time distribution EXP EXP expander expander graphs expanders expanders expanding expanding expanding grammars expanding graphs expanding morphism expanding properties of graphs expansion expansion expansion of events expansion rules expansion theorem for ACP expansions expansions expansions of combinatory algebras expansions of interiors of λ-models expansive expansive extensional rules for eta expectation expectation expectation operator expectation sets expected expected access time expected behaviour expected communication complexity expected complexity expected cost expected look-up time expected message complexity expected number expected number of expected number of messages for distributed selection expected number of moves expected number of processors expected performance expected time expected time polynomial expected time solution expected value measures expected-value experiment experiment schemes experimental experimental experimental input-outputs data experimental results experimental tool experiments experiments experiments on parallel processes expert expert expert decisions expert domains expert systems EXPH EXPH explanation explicit explicit abstraction operator explicit characterization explicit characterizations explicit coercions explicit computation of derivatives explicit language explicit language equations explicit language relations explicit loops explicit negation explicit negation operator explicit polynomial transformations explicit recursion explicit representations explicit sequences explicit sequences of Boolean functions explicit substitution explicit substitutions explicit time school explicit upper bounds exploiting cancellations explosion exponent exponent of matrix multiplication complexity exponential exponential exponential algorithms exponential behavior exponential blow-up exponential bounds exponential complexity of exponential complexity of key sets exponential complexity of sets of functional dependencies exponential connectives exponential cycles exponential deterministic time exponential distribution exponential distributions exponential formal power exponential function exponential gain by using substraction exponential gap exponential growth exponential hierarchy exponential in the dimension exponential lower bounds exponential lower bounds on the number of nodes of threshold-MODr circuits exponential monotone time exponential power exponential power of negation exponential proof procedure exponential single server exponential size exponential space exponential space algorithm exponential speedup by using negation exponential speed-up exponential stratification scheme exponential sums exponential time exponential time bounded equivalent exponential time complexity exponential time recognizable languages exponential time solutions exponential trade-off exponential trade-off of negation versus complexity exponential types exponential upper bound exponential worst-case time complexity exponentially exponentially exponentially bounded problems exponentially long proofs exponentially more powerful exponentials exponentials exponential-time exponential-time algorithm exponential-time bounded exponential-time complete sets exponential-time computable sets exponential-time decision exponential-time decision algorithm exponential-time decision procedure exponential-time hierarchy exponential-time languages exponentiation exponentiation exponentiation bifunctor exponentiation modulo a large number expressibility expressibility expressibility of stratified logic programs expressible queries expressing expressing liveness properties expressing program looping expressing program looping in regular dynamic logic expressing safety properties expressing temporal properties expression expression complexity expression evaluation expression of preferences expressions expressions from the polynomial hierarchy expressions in expressions in models expressions in URE expressions of expressions of infinite length expressions of intractable complexity expressions with distinct input symbols expression-trees expressive expressive completeness expressive extensions expressive machinery of linear logic expressive model expressive power expressive power for defining intermediate languages expressive power of expressive power of a language expressive power of a logic expressive power of algebraic specification languages expressive power of cardinality-bounded set values expressive power of counting expressive power of Datalogcirc expressive power of dynamic logic expressive power of first-order dynamic logics expressive power of first-order logic expressive power of first-order logic with arithmetic expressive power of implicit specifications expressive power of languages expressive power of map theory expressive power of Milner's synchronous calculus expressive power of nonmonotonic formalisms expressive power of PL expressive power of programming languages expressive power of quantifier free dynamic logic expressive power of rule-based query languages expressive power of subtypes expressive power of temporal logic expressive power of the μ-calculus expressive power of the π-calculus expressive powers expressive strengths of Forum expressive structure expressiveness expressiveness expressiveness in expressiveness in Hoare's logic expressiveness in program logics expressiveness of a query language expressiveness of FIL expressiveness of finite set languages expressiveness of interactive models expressiveness of languages expressiveness of LL expressiveness of name-passing calculi expressiveness of programming logics expressiveness of query languages expressiveness of SDPDL expressiveness of the π-calculus expressivity expressivity of a model EXPSPACE EXPSPACE EXPTIME EXPTIME =? NEXPTIME EXPTIME complete EXPTIME complete sets EXPTIME-complete EXPTIME-completeness EXPTIME-P EXRUD EXRUD(A) class of languages extended extended λ-calculus extended abstract data type extended abstract data type theory extended Alexander method extended applicative type structures extended backtracking extended Cohen-Grossberg model extended combinator code extended computation tree logic extended direct branching algorithm extended divisions extended E0L grammars extended free-choice Petri nets extended free-choice systems extended instanciation modes extended join dependencies extended logic extended logic programming extended logic programs extended logics extended low hierarchy extended ML extended model extended model of Shaw's flow expressions extended P4-reducible graph extended P4-sparse graph extended pushdown automaton extended regular expression extended regular expressions extended resolution extended Riemann Hypothesis extended rudimentary languages extended semantics extended Skolem arithmetic extended Sokolowski's condition extended system structures extended tabled node-replacement graph L-systems extended theories extended Turing machines extended type theory extended typed λ-calculus extended VASS's extending extending a partial parametrization extending computability extending Hopcroft's fast partitioning algorithms extending positive Horn clause logic extending regular expressions with iterated shuffle extensible extensible extensible environments extensible systems extension extension field extension lemma extension of extension of a default theory extension of ACP extension of classical logic extension of combinatory logic extension of Curry's basic functionality theory extension of Curry's functionality theory extension of Curry's system extension of Datalog extension of dynamic logic extension of Hennessy-Milner logic with recursion extension of Higman's theorem extension of Higman's theorem to infinite words extension of Horn-clause logic extension of Kleene extension of Klop's counterexample extension of logic programming extension of models extension of nondeterministic finite automata extension of PL extension of Presburger arithmetic extension of Prolog extension of propositional dynamic logic extension of pure type systems extension of states extension of the extension of the language S-TL extension of traces extension of typed lambda calculi extension procedures extensional extensional extensional algebras extensional behaviour extensional collapse extensional equality extensional equality of streams extensional fixed-point semantics extensional knowledge base extensional lambda calculi extensional model in Pω extensional model in Pω for the pure λ-calculus extensional models extensional models for polymorphism extensional models type theory extensional property extensional semantics extensional theory of program correctness extensional treatment of dataflow deadlock extensional typed λ-calculus extensions extensions extensions of extensions of algebras extensions of braid groups extensions of Codd's completeness theorem extensions of Curry's system extensions of D1L languages extensions of Datalog extensions of embeddings extensions of goals in SLDNF resolutions extensions of PD1L languages extensions of PD2L languages extensions of Petri nets extensions of typed lambda calculi exterior exterior exterior ballistics exterior node external external external behaviours external equivalence external file organization external functions external interactions external merging external mobility mechanisms external path length external path length of a search tree external path length viewpoint external trace preorder relation externally externally deterministic extra links extracting extracting parallelism from programs extracting programs from constructive proofs extraction extraction extraction of knowledge rules extraction of programs extrema extremal extremal extremal algorithmic problems extremal automata extremal conditions of codes extremal graph theory extremal properties of codes extremal solutions extremal solutions of inequations extreme extreme points E-bi-immune e-CCC structure E-complete kernel E-hard kernel E-pattern languages E-unification E-unification algorithm E-unification problems E-unifiers Fu¨lo¨p Fu¨lo¨p and Va´gvo¨lgyi Fu¨rer F≤ F≤ expressions F≤ type checking Fω F1 F11 inductive types Fabre fabric faces facilitating efficient bottom-up evaluation facility location facility of coinductive definitions factor factor factor automata factor of a word factor order factor ordering factor pumping conditions factor set of a word factor size factor transducer of a word factorability factorial factorial language factoring factoring factoring a large number factoring algorithm factoring multivariate integral polynomials factoring of integers factoring polynomials factoring property factorisability factorisable factorisable polynomial vector fields factorization factorization factorization algorithm factorization algorithms factorization codes factorization conjecture of Schu¨tzenberger factorization forests factorization forests of finite height factorization of factorization of codes factorization of integral factorization of integral coefficient polynomials factorization of integral polynomials factorization of multivariate polynomials over a finite field factorization of numbers factorization of polynomials factorization of polynomials algorithm for factorization of polynomials in a fixed number of variables factorization of polynomials with integer coefficients factorization over finite fields factorization theorem factorizations factorizations factorizations of factorizations of finite cyclic groups factorizations of fix helps factorizations of free monoids factorizations of polynomials factorize factorizing factorizing factorizing strings factorizing words factors factors factors of factors of a finite language factors of all 2-paperfolding sequences factors of Dyck words factors of finite automata factors of infinite words factors of Motzkin words factors of polynomials factors of Sturmian factors of Sturmian sequences factors of Sturmian words factors of the Fibonacci sequence factors of words factual sentence Fagin Fagin failed derivations failure failure equivalence failure function automaton failure functions failure hypothesis failure prone environment failure rate failure rule failure tests failure tree failures failure-equivalence fair fair abstraction rule fair asynchrony fair behaviour fair bisimilarity fair channel in CSP fair chaotic iterations fair communicating merge fair computation sequence fair computations fair distribution of letters fair execution sequences fair executions fair implementations of processes fair infinite behavior fair merge fair merge constructor-sharing fair merge constructs fair merge functions fair nondeterminism fair nontermination problem fair nontermination problem for conflict-free Petri nets fair occurrence sequence fair Petri nets fair scheduling fair search rule fair semantics fair semantics of programs fair semantics with invisible enabledness fair SLD resolution fair SLD-trees fair termination fair termination problem fair termination rule fairness fairness fairness assumption fairness assumptions fairness constructs fairness definitions fairness in fairness in morphisms of transition systems fairness in multi-agent systems fairness in the semantics of programming logic fairness of fairness of a program execution fairness of random algorithms faithful faithful faithful computational model of the real numbers faithful extension faithful rational transductions faithfull faithfull embedding faithfull extensions false FAM FAM FAM's families families families of families of ω-languages families of ω-sets families of bi-infite word languages families of categories families of connected sets families of context-free families of context-free grammars families of context-free languages families of DPDA's families of HD0L languages families of hyperplanes families of languages families of maps families of nodes in a tree families of non real time DPDA's families of PMF-designs families of polynomials families of projections families of recursive languages families of SBTA-languages families of strict deterministic languages families of subsets families of trees families of weak-connected graphs family family of family of context free languages family of context-free languages family of Crole and Pitts family of cross dependencies family of identifiers family of languages family of languages TISP(T(n),S(n)) family of linear indexed languages family of transformations family trees FAMs fan fans fans of polynomial ideals fan-in fan-in 2 circuits fan-in Boolean circuits fan-out rewriting Farach Farach and Amir Farey Farey Farey correspondence Farey monoid Farey series Farey tree Farinas Farinas del Cerro and Penttonen farm Farmer Farmer fast algorithm for systems of linear inequalities fast algorithms fast algorithms for the characteristic polynomial fast algorithms for unique decipherability fast algorithms in finite algebras fast approximation fast approximation algorithms fast approximation schemes fast decomposition method fast detection of polyhedral intersection fast finite Fourier transform fast Fourier transform fast Fourier transform method fast geometric approximation techniques fast heuristics fast heuristics for systems of linear inequalities fast heuristics for sytems of linear inequalities fast memory fast numerical algorithm fast numerical algorithm for composition of power series fast parallel language recognition fast parallel language recognition by cellular automata fast parallel string prefix-matching fast parallelization fast partitioning algorithm fast planning fast quantifier elimination fast recognition fast recognition of deterministic cfl fast scan-line algorithm fast simplification algorithm fast solution of Moldavanskii's conjugacy problem fast stable sorting algorithm fast turnaround fast uniform generation of regular graphs fast verification of primality fastest algorithms fastest program fastest program a.e for an r.e. set Fatou Fatou Fatou extensions Fatou property fault fault fault preorders fault tolerance fault tolerance of syntax fault tolerant fault tolerant distributed systems faults faults faulty faulty EREW PRAM faulty processes fault-prone machine fault-tolerance fault-tolerant fault-tolerant architecture fault-tolerant mesh architecture fault-tolerant process fault-tolerant processes favorable favorable input FBDD FBDDs FBDDs FCP FCP FD FD families FD family FD's FD's FD's as constraints FDs FD-families FD-relations FE FE rule in F-semantics feasibility feasibility problems feasible feasible automated deduction feasible search feasible solution feasible solutions feature feature aspects feature constraint system feature descriptions feature graphs feature of concurrency feature structures feature tree structure feature trees features features of context free grammars features of context-free grammars feedback feedback feedback operation feedback theory feedback vertex set feedback vertex set problem Feferman Feferman Feferman and Maclane Felice Fellows Fellows et al. Fernau Fernau Ferreira Ferrers Ferrers diagrams fewness fewness Feys FFT FFT FFT algorithm FFT graph FFT method for convolution FGLM FGLM conversion method FI fi FI rule in F-semantics Fiat Fiat et al. Fibonacci Fibonacci Fibonacci morphism Fibonacci morphisms Fibonacci numbers Fibonacci number-system Fibonacci searches Fibonacci sequence Fibonacci string Fibonacci word Fibonacci words fibration fibrations fibrations fibred fibred category Fich Fich field field arithmetic operations field extension field of field of characteristic zero field of constants field of real numbers fields fields of characteristic zero FIFO FIFO fifo FIFO automata FIFO buffers fifo channel FIFO channels FIFO first-in-first-out FIFO nets FIFO networks FIFO networks tapes FIFO queue automata FIFO-queues fifth normal form FIL FIL filamentous filamentous organisms file file design for retrieval file designs for retrieval file organization filling domain filter filter filter λ I-calculus filter λ-models filter domains filter domains equation filter model filter models filtering filtration filtration technique final final algebra final algebra semantics final algebras final datatypes final hypothesis final marking constraints final markings final object final or terminal algebra semantics final positions final topology final topology of a representation final values finality finality findability findability of zeros in Z-rational sequences finding finding blocking probabilities finding common subtrees finding consistent sequences finding design errors finding errors finding maxima finding minimal objects finding minimum-length generator sequences finding repeated patterns finding sequences consistent finding square roots modulo a prime finding squares fine classification fine classification of ω-regular languages fine classification of Muller automata fine covers fine covers of VAS languages fine hierarchy fine hierarchy of regular ω-languages fine structure fine structure of regular ω-languages finer control fine-heap finitarily finitarily isomorphic finitariness finitariness finitary finitary finitary algebraic substitution finitary and infinitary languages finitary axiomatization finitary axiomatization of observational equality finitary constructs for program transformations finitary formal language finitary implicit operations finitary languages finitary modal logic finitary operations finitary proof system finitary qualitative domains finitary quasi-uniformity finitary rational finitary rational language finitary Scott-domain finitary signature finitary universal algebra finite finite ω-complete finite ω-complete enrichment finite Abelian groups finite acceptance of infinite words finite accuracy semantics finite acyclic finite acyclic process graphs finite acyclic process graphs for ACPτ finite algebra finite algebraic systems finite alphabetic information finite alphabets finite and infinite behaviors finite approximation by enrichment finite approximations finite arity finite array language finite automata finite automata networks finite automata on infinite trees finite automata over semirings finite automata with finite automata with distance functions finite automata with multiplication finite automaton constructions finite automaton with multiplication finite behaviors finite behaviour finite behaviour matrix finite behaviour of concurrent systems finite bifix code finite biprefix finite biprefix code finite biprefix sets of paths in a graph finite Boolean algebras finite bounded-degree networks finite branching automata finite canonical finite canonical presentation finite canonical string-rewriting systems finite Church-Rosser finite Church-Rosser reduction systems finite Church-Rosser system finite circular codes finite codes finite codes with finite codes with finite deciphering delay finite codes with unique splitting finite complete finite complete 2-level rewriting systems finite complete biprefix codes finite complete replacement systems finite complete rewriting finite complete rewriting system finite complete rewriting systems finite complete set finite computation sequences finite configurations finite configurations extending finite congruence finite constants finite containment problem finite containment problem for Petri nets finite control fragment of the π-calculus finite cover finite D0L languages finite data types finite definability of queues finite degree finite delay operator finite derivation type finite developments finite difference calculus finite differences finite differencing finite directed edge-labeled graphs finite discrete neural networks finite divergence finite domain finite domains finite element analysis finite element analysis environment finite elementary codes finite elements finite equational specification finite equivalence relations finite event structures finite factors of infinite words finite failure finite failure rule finite failure set finite failures finite field finite fields finite frames finite full trace automata finite games finite graph languages finite graphs finite group finite groups finite height factorization finite hereditary permutators finite hidden enrichment specification finite hypergraphs finite identification finite image finite injury finite injury priority arguments finite injury proof finite integer databases finite interpretation finite interpretations finite iterations finite joins finite Kripke structures finite labelled finite labelled transition systems finite labelled trees finite labelling problem finite language finite languages finite lattice finite learning finite left simple semigroups finite local codes finite manipulation of infinite sets finite many-sorted signature finite mathematical structures finite mathematics finite maximal codes finite maximal prefix finite maximal prefix sets of words finite memory finite model finite model property finite model theory finite models finite monadic finite monadic Church-Rosser systems finite monadic Church-Rosser Thue finite monadic Church-Rosser Thue system finite monadic Church-Rosser Thue systems finite monadic string-rewriting systems finite monadic systems finite monoid finite monoids finite morphic refinement finite multisets finite m-presentation finite name spaces finite net finite net implementation finite nets finite nondeterminism finite nondeterministic automaton finite nonmonadic Church-Rosser Thue systems finite non-monadic Church-Rosser Thue systems finite number of function symbols finite number of periodic points finite number of rewriting steps finite observations finite observations of Hoare finite observations of Hoare et al. finite operational semantics finite order finite parallel generating system finite partition finite partizan combinatorial games finite Petri nets finite power property finite power property for context free languages finite power property for context-free languages finite prefix code finite prefix codes finite presentations finite presentations of monoids and groups finite process finite Ramsey theorem finite reachability theorem finite recursive specifications finite relational structures finite representation finite right simple semigroups finite samples finite semantics finite semigroup finite semigroup varieties finite semigroups finite semigroups of matrices finite semilattices finite semi-Thue systems finite semi-Thue systems with decidable word problem finite sequence of equations finite sequences finite set of generators finite set of regular grammars finite set of strings finite sets finite sets of constraints finite signature extension finite signatures finite simple semigroups finite solvable groups finite stable trace automata finite state finite state asynchronous cellular automata finite state automata finite state automata guaranteeing viability finite state automata with multiplicities finite state cellular automata finite state control finite state control automata finite state control automata machines finite state machine finite state machines finite state pattern matching machines finite state transduction finite state transition system finite stationary processes finite streams of substitutions finite string-rewriting system finite string-rewriting systems finite structures finite Sturmian words finite stuttering finite substitutions finite substitutions on finite domains finite symbolic finite symbolic transition graphs finite symbolic trees finite synchronization finite synchronization delay finite synchronization nets finite syntactic monoid finite test set finite Thue system finite Thue systems finite Thue systems with decidable word problem finite tiers finite tilings finite time finite trace finite trace automata finite trace replacement systems finite traces finite transducer mapping finite transducers finite transductions finite transition systems finite tree automata finite trees finite turn pushdown machines finite type finite type subshifts finite type theory finite T-trivial monoid finite union of finite union of congruence classes finite union of synchronous products of recognizabie languages finite union of universal languages finite unions finite valued finite valued finite transducers finite valued transducers finite variation finite variations finite VASS finite VASS's finite vector addition systems finite visit finite visit automata finite visit checking automata finite word finite worst case guarantee finitely finitely finitely ambiguous finitely ambiguous nondeterministic finite automata finitely axiomatizable finitely axiomatized finitely branching finitely branching condition finitely coloured graphs finitely completable code finitely defined graph languages finitely generated finitely generated Abelian groups finitely generated biω-languages finitely generated commutative monoid finitely generated congruences finitely generated free finitely generated free algebras finitely generated free monoid finitely generated free monoids finitely generated F-semigroups finitely generated group finitely generated group with one relation presentation finitely generated ideal finitely generated language finitely generated recursive logic finitely generated right-congruences finitely generated semigroup finitely generated semigroups finitely generated sofic systems finitely generated submonoid finitely generated word semigroup finitely observable structures finitely presentable recursive monoid finitely presented structures finitely recursively definable finitely representable finitely representable group finitely specifiable ID finitely specifiable ID family finitely typed finitely typed functional programs finitely typed recursive procedures finitely-generated free monoid finitely-generated submonoid finiteness finiteness finiteness condition finiteness conditions for semigroups finiteness dependencies finiteness of finiteness of codes finiteness of congruence quotients finiteness of intersection for HD0L sequences finiteness of Kleen semigroups finiteness problems finiteness question for recursively enumerable sets finite-automaton aperiodicity finite-automaton languages finite-branching trees finite-dimensional matrix generator finite-element code finite-field arithmetic finite-field arithmetic operations finite-memory automata finite-model finite-model property finite-model theory finite-state finite-state ω-languages finite-state automata finite-state defense finite-state machine finite-state machines finite-state machines of a language finite-state process finite-state recursion finite-state strategies finite-state systems finite-state transducers finite-state tree transducer finite-trace monoids finite-turn finite-turn counter finite-turn nondeterministic counter automaton finite-valued finite-valued distance automata finite-valued graphs finite-valuedness finite-valuedness problem for sequential machines finitistic finitistic finitistic axiomatization finitistic proof system Finkel Finkel and Gelenbe fireability fireability property of nets firing firing firing in a net firing in nets firing mob problem firing sequence firing sequences firing sequences for graphs firing sequences for polyautomata networks firing sequences of Petri nets firing squad synchronization problem firing time algorithms firing transitions first class first class contexts first class messages first class modules first in first out first level nodes first order first order algebraic differential equations first order algebraic rewriting first order approximation of algorithmic theories first order arithmetic first order arithmetical formula first order assertion language first order axiomatization of the theory of iteration first order case first order constraint language first order contexts first order continuous functions first order data structures first order definable first order definable in the presence of arithmetic first order definable properties first order definable real trace languages first order dynamic first order dynamic language first order dynamic logic first order dynamic logics first order equational theory first order format first order formula in algebra first order formulae first order formulas first order framework of abstract data types first order functional language first order functions first order inductive theory first order infinitary logic first order language first order languages first order lazy functional languages first order linear first order linear differential systems first order linear logic first order linear-time temporal logic first order logic first order logic completeness and first order logic first order logic expressive power of first order logic first order logic for partial functions first order logic formulae first order logic formulas first order logic formulas Horn formulas in first order logic first order logic formulas interpretation theorem of first order logic first order logic formulas LOGSPACE extension of first order logic first order logic of effects first order logic programming first order logic proof methods first order logic specifications first order logic with first order logic with arithmetic first order logic with fixpoints first order modal first order modal logic first order modal systems first order model theory first order monadic logic first order nonclassical logic first order normal modal logics first order notion first order operations first order oracle first order part of Bu¨chi's second-order formulas first order polymorphism first order predicate first order predicate calculus first order predicate logic first order programs first order properties of specifications first order quantification first order queries first order query first order reasoning systems first order reduction first order rewriting first order sentence first order signature first order signatures first order specification language first order specifications first order spectra first order structure first order structures first order temporal first order temporal logic first order temporal logic with until first order temporal logiclanguage first order temporal logics first order term rewriting systems first order terms first order tests first order theorems first order theories first order theory first order theory of first order theory of composition first order theory of equality first order theory of lexicographic path orderings first order theory of natural numbers first order theory of permutations first order three valued logic for partial functions first order typable λ-terms first order type dependency first order typed language first order types first- and second-order logics first-class first-class contexts first-class messages first-class modules first-level nodes first-order first-order algebraic rewriting first-order approximation of algorithmic theories first-order arithmetic first-order arithmetical formula first-order assertion language first-order case first-order constraint language first-order contexts first-order data structures first-order definable first-order definable in the presence of arithmetic first-order definable real trace languages first-order dynamic logic first-order equational theory first-order format first-order format of term rewriting first-order formulae first-order formulas first-order framework of abstract data types first-order functional language first-order functions first-order inductive theory first-order infinitary logic first-order language first-order languages first-order lazy functional languages first-order linear first-order linear differential systems first-order linear logic first-order linear-time temporal logic first-order logic first-order logic formulae first-order logic formulas first-order logic programming first-order logic specifications first-order logic with first-order logic with arithmetic first-order logic with fixpoints first-order modal first-order modal logic first-order modal systems first-order model theory first-order monadic logic first-order normal modal logics first-order notion first-order operations first-order oracle first-order part of Bu¨chi's second-order formulas first-order polymorphism first-order predicate first-order predicate calculus first-order predicate logic first-order programs first-order properties of specifications first-order quantification first-order queries first-order reasoning systems first-order reduction first-order rewriting first-order sentence first-order signature first-order signatures first-order specification language first-order specifications first-order spectra first-order structures first-order temporal first-order temporal logic first-order temporal logic language first-order temporal logic with until first-order temporal logiclanguage first-order temporal logics first-order term rewriting systems first-order terms first-order tests first-order theories first-order theory first-order theory FT first-order theory of first-order theory of composition first-order theory of lexicographic path orderings first-order theory of natural numbers first-order theory of permutations first-order typable λ-terms first-order type dependency first-order types Fischer Fischer Fischer and Rabin Fisher fitness fitness fitness function fitness scaling methods fitness selection fitness-rank dependence fitness-scaled genetic algorithms Fitting Fitting and Kunen Fitting's extension of logic programming to bilattices Fitting's theory FIX Fix fix Fix et al. FIX logical system fixed fixed alphabets fixed and undetermined universes fixed arity constructors fixed bound on the cardinality of set values fixed class of data abstractions fixed degree separations fixed directed subgraph homeomorphism problem fixed integers fixed interpretation fixed number of fixed number of errors fixed number of local storage locations fixed number of parallel processes fixed number of program variables fixed number of sortings fixed point fixed point calculi of Milner and Hoare fixed point characterization fixed point characterizations fixed point combinator fixed point combinators fixed point construction of Scott fixed point equations fixed point equations in inverse limits fixed point equivalence relations fixed point hierarchy fixed point induction fixed point methods fixed point multiplication fixed point operation over a category fixed point operator fixed point operators fixed point properties fixed point semantics fixed point semantics for deterministic data flow fixed point solutions fixed point theorem fixed point theorems fixed point theorems for context-sensitive languages fixed point theorems in Cartesian closed categories fixed points fixed points in free process algebras fixed points of fixed points of continuous functions fixed points of continuous predicate transformers fixed points of contractions fixed points of functors fixed points of monotone operators fixed rule fixed singular points fixed singularities fixed size fixed start fixed start time scheduling fixed tasks in task assignment problems fixed transceiver fixedpoint fixedpoint fixedpoint access method fixedpoint constructions fixedpoint constructions in order-enriched categories fixedpoint constructions of Scott fixedpoint equations fixedpoint operators fixedpoint properties fixedpoint theorems fixedpoints fixedpoints fixedpoints of recursive definitions fixed-degree algebraic decision tree fixed-parameter fixed-parameter problems fixed-parameter reductions fixed-parameter tractability fixed-parameter tractable fixed-point fixed-point algorithm fixed-point characterization fixed-point characterization theorems fixed-point generation fixed-point operations on CCC's fixed-point operator fixed-point queries fixed-point queries on binary trees fixed-point semantics fixed-point semantics of KBL's operational semantics fixed-point solutions fixed-point theorem fixed-point theory fixpoint fixpoint fixpoint calculi fixpoint characterization fixpoint computation fixpoint computations fixpoint constant fixpoint constructor fixpoint equations fixpoint expressions fixpoint formula fixpoint functional equation fixpoint induction fixpoint logic fixpoint nesting fixpoint operator fixpoint semantics fixpoint semantics of Horn sentences fixpoint techniques fixpoint theory fixpoint transformations fixpoints fixpoints fixpoints of fixpoints of functions fixpoints of substitutions fixpoints of unispectral morphisms FIX-logic FL FL FL program FLA FLA Flajolet Flajolet Flajolet and Steyaert Flajolet et al. flame flame front flat flat flat algebra flat coherence spaces flat databases flat domains flat domains equation flat dynamic Prolog flat form flat GHC flat guarded Horn clauses flat lattices flat PCP flat Prolog flat relational databases flat relations flat systems flattened flattened category flattened functor flattening flattening flatwords flatwords flavor flexibility flexibility flexible flexible flexible hierarchic development methods flexible queries flexible queries in relational databases flexible software assembly Fliess Fliess Fliess' power series flip flip networks floating floating molecules floating point floating point numbers floating point operations in computer graphics floating-point adder floating-point addition floating-point addition algorithm floating-point arithmetic floating-point operation floor floor operator floor operator on rationals floor-like operator floundering floundering floundering on negation flow flow flow algebra flow analysis flow diagrams flow equivalence flow expressions flow graphs flow languages flow languages to Petri net languages flow of program control flow problem flowchart flowchart flowchart algorithms flowchart programmable partial functions flowchart programs flowchart programs with recursive procedures flowchart schemes flowchart theories flowcharts flowcharts flowcharts of programs flowgraph flowgraph flowgraph equations flowgraphs flowgraphs flows flow-chart programs flow-diagrams with arrays flow-shop problems Floyd Floyd Floyd proofs Floyd's Floyd's Floyd's algorithm Floyd's family of languages Floyd's method Floyd's principle Floyd's well-founded sets method Floyd's well-founded sets method for termination Floyd-Hoare Floyd-Hoare derivability Floyd-Hoare invariant assertion method Floyd-Hoare invariant assertion method for partial correctness Floyd-Hoare logic Floyd-Hoare logic in Floyd-Hoare logic in iteration theories Floyd-Hoare logic in nonstandard logics of programs Floyd-Hoare method FO FO Foata focus fold fold fold composition fold composition of total deterministic macro tree transducers by recursive pushdown machines folding folding folding rule folding transformation folk folk theorems folk theorems in parallel computation folklore folklore theorems fooling fooling fooling a two way automaton fooling set method for complexity lower bounds fooling two-way automata for element distinctness for programs forbidden forbidden forbidden configurations forbidden induced subgraphs forbidden minor characterization forbidden pairs forbidden suborders forbidden words forbidding forbidding conditions force force computations as ideals force player forcing forcing forcing domain of a Boolean network forcing domains of Boolean networks forcing terms Ford Ford and Fulkerson Ford-Fulkerson Ford-Fulkerson procedure Ford-Fulkersonmaximum flow procedure Ford-Johnson-sorting forest forest forest matching forest of finite finite height factorization forest product forests forests forests of finite finite height factorization forgetful forgetful forgetful determinacy theorem of Gurevitch and Harrington forgetful functor forging forging signatures fork fork algebras forks fork-statement form form equivalence form equivalence of form equivalence of L-forms form equivalence of PD0L forms form equivalence problem form equivalent formal formal algebra formal calculi formal calculus of operations formal construction methods formal correctness formal correctness argument for bitonic sorting formal correctness of a parser formal criteria for completeness formal deductibility formal definition of formal definition of dependencies formal definition of the EML language formal derivative formal description of parsers formal designs formal designs of languages formal development of modular standard ML formal equality rule formal equivalence proof formal expression formal forms formal foundation for parallelization formal function formal grammars formal inference system formal language formal language operations formal language theory formal languages formal languages for timers formal language-theoretic closure properties formal manipulation of assertions formal matrices formal methods formal methods for structured programming formal model formal model for concurrent computations formal models formal models for communication formal operational semantics formal parametric polymorphism formal power series formal power series in formal power series in noncommutative variables formal power series in noncommuting variables formal power series on noncommuting variables formal power series over semirings formal programming semantics formal proof formal proof of correctness formal proof systems formal proofs formal proofs of quantified specification formal properties formal properties of synchronized concurrent expressions formal pseudo-differential operators formal reasoning formal reasoning on programs formal relationship formal representation of flowchart schemes formal semantics formal semantics for priority path formal semantics of CCP formal sentences formal series formal series of trees formal software verification formal solutions of DE's formal spaces formal specification formal specification languages formal specifications formal string language theory formal system formal system for assigning formal system for assigning type schemes formal systems formal systems for join dependencies formal theory formal theory of types formal treatment formal treatment of inconsistency formal tree power series formal type assignment formal verification formal verification based on process algebra formalism formalism formalism for formalism for exception handling formalism for merge formalism of formalism of algebraic specification formalism of loosely coUP formalism of loosely coupled systems formalism of regular expressions formalism of symbolic dynamics formalism of temporal logic formalisms formalisms formalisms for unbounded choice formalization formalization of formalization of constructive mathematics formalization of data structures formalization of denotational semantics formalization of the Qu-Prolog unification algorithm formalization of the tautology problem formalized formalized arguments about programs formalizing formalizing formalizing Dijkstra's predicate transformer formalizing proofs formalizing the semantics of concurrent programs formally undecidable propositions formation formation of well-founded trees formation tree formats formedness forming generalizations forming generalizations of concepts forms formula formula formula complexity formula provability formula versus type formulae formulae of dynamic logic formulae-as-types formulae-as-types correspondence formulas formulas formulas for antipodes formulas of finite bounded depth formulas with no repeated variable formulation formulations formula-as-type correspondence form-equivalence form-equivalence of deterministic pure grammar forms Forsythe Forsythe Fortenbacher fortification Fortnow Fortnow and Sipser Fortran Fortran Fortran programs Fortune Fortune Fortune, Hopcroft and Wyllie Forum forward forward chaining forward chaining algorithm forward chaining mechanism forward closure conditions forward closures forward modalities forward propagation forwards conflict Forys Forys foundation of machine discovery foundations foundations of mathematics founded foundedness Fourier Fourier Fourier analysis Fourier expansion Fourier series Fourier transform Fourier transforms Fourman Fourman's Fourman's analysis of potentially infinite objects fourth normal form four-colour theorem four-colouring planar graphs four-element codes four-valued logic FP FP0L languages FPNPll FPNPlog FPTAS FPTAS FP-like language fractal fractal fractal describable fractal functions fractal geometry fractal pattern fractal sets fractals fractals fraction fraction ring fractional fractional part fractional part of a number fractional power fractions fractions fracture fracture fracture edge fracture graph fracture path Fraenkel fragment fragment of algorithmic logic fragment of intuitionistic logic fragment of linear logic fragment of predicate logic fragment of the π-calculus fragmentary fragmentary complexity fragmentary complexity of symbolic sequences fragments fragments of combinatory logic fragments of L∞ fragments of linear logic fragments of logic fragments of multiplicative linear logic fragments of predicate logic fragments of propositional logic fragments of second order logic fragments of weak combinatory logic Fraďssé frames frames framework framework for formal language theory framework of deductive databases framework of discrete iterations framework of duplicator framework of graph grammar theory framework of inductive definitions framework of inductive inference framework of learning framework of real number models framework of state-labelled structures frameworks Fran Francez Francez Françon Frederickson Frederickson Fredholm Fredholm determinant Fredman Fredman free free algebra free algebra functor free algebras free algebras over continuous domains free amalgamated product free associative algebra free binary decision diagrams free Boolean algebra free choice free choice nets free choice systems free commutative free commutative monoid free commutative monoids free concatenations free constructions free constructions in free constructions in abstract algebraic institutions free constructions in algebraic institutions free continuous free continuous algebras free continuous semilattices free cyclic monoid free distributive free distributive lattice free distributive lattices free dynamic algebra free extension free finite state machines free functor free functors free group free groups free higher type algebras free inverse monoid free iterative theories free languages free left distributive structures free Lie free Lie algebra free Lie algebras free model free model of a theory free models free models in abstract algebraic institutions free monadic recursion schemes free monoid free monoids free noncommutative algebra free noncommutative monoids free objects free of free of crossing cuts free of deadlock free partially Abelian monoid free partially Abelian monoids free partially commutative free partially commutative monoids free procedure names free procedures free process algebras free products free products of free products of free commutative monoids free products of monoids free semigroup free semigroups free semimodules free separately Δ-continuous algebras free shuffle algebras free space free spectra free structures free submonoid free symbols free theory free type variables free upper regular bands free variables freedom of failure freeness freeness free-choice nets Frege Frege Frege proof systems Frege systems Freivalds Freivalds Freivalds and Chen Frenkel frequencies frequencies of frequencies of deadlocked executions frequencies of factors frequencies of productions frequency frequency frequency computation frequency of factors in the Fibonacci sequence Friedberg Friedberg-Muchnik theorem Friedman Friedman and Greibach friendly semantics fringe fringe Frisch Frisch's hybrid model Frobenius frontier frontier frontier operation frontier testable tree languages frontier-preserving homomorphic images Frot FSSP FSSP fssp FSSP firing squad synchronization problem fssp problem on graphs FT FT FT, constraint system FTR FTR-language Fu Fu et al. fugitive fugitive-search games on graphs Fujino fulfillment Fulkerson Fulkerson and Ford full full abstraction full abstraction for equational languages full abstraction for the second order subset of ALG full abstraction of another semantic model full abstraction proof full abstractness full AFL full AFL's full classical multiplicative logic full coverage full currying full cut rule full domain full domains full embedding full first-order linear logic full hardness full hyper (1)-AFL full implicational dependencies full interpretations full intuitionistic linear logic full linear logic full matrix equivalence problem full monadic logic full parallelism full principal full principal cones full principal semi-AFL full semiAFL full semi-AFL's full subcategories full subgraph full trace automata full trio operations full trios full type theory full uniform code fully abstract fully abstract denotational model fully abstract for fortification fully abstract model fully abstract model for fully abstract model for process equivalence fully abstract model for the second order subset of the functional language PCF fully abstract models fully abstract models for languages for distributed programming fully abstract models of typed λ-calculi fully abstract semantic models fully abstract semantics fully connected systems fully distributed quorum consensus method fully dynamic task-tree scheduling fully ordered group fully parallel updates fully recursive types fully synchronised parallel composition full-AFL of context-free languages Fun fun function function function application function arguments function bases function calculators function class function classes function classes FLNPlog function coarsest partition problem function counting rooted planar maps function decomposition function field function identification function learning function mapping permutations function memorization function of normalization function parameters function programming function shells function space function space objects function space of a domain function space type function spaces function strict in an argument function symbols function types function value queries functional functional functional λ abstraction algebra functional abstraction functional application functional arguments functional aspects of domain theory functional attributes functional completeness functional completeness theorem functional complexity functional composition functional composition of formal power series functional computation functional dependencies functional dependencies functional dependencies as constraints functional dependencies in functional dependencies in random databases functional dependencies in relational databases functional dependency functional dependency families functional dependency inference problem functional dimension functional dimension of inductive definitions functional equation functional equations functional equivalence functional expansions functional fixpoint equations functional forms functional graphs functional implementation technique functional implementations functional input/output behavior functional iteration functional LAA functional language functional language ML functional language PCF functional languages functional level of recursion functional logic languages functional logic languages for distributed programming functional model functional operators functional paradigm functional parameters functional program functional programming functional programming language functional programming languages functional programming system functional programs functional properties functional rational transductions functional relations functional semantics functional semantics of graph-like LISP expressions functional specification functional symbols functional term functionality functionality of hypothetical reasoning functionality theory functionality theory of Curry functionally functionally functionally closed sets functionally complete functionally oriented programming languages functionals functionals functions functions functions between domains functions computable by an R-program functions computable by bounded Turing machines functions computable by certain classes of Turing machines functions computable by finite automata functions computable by reversal-bounded multicounter machines functions computed by monotone Boolean formulas functions definable by Presburger formulas functions of a complex variable functions of changeable input size functions of natural numbers functions of problem size functions of uniform complexity functions on functions on real numbers functions on words functions over universal algebras functions that are hard to compute functions which pass information down a tree functions with linear complexity functions with memory function-free function-free clauses function-free first-order programs function-type function-type constructions function-type symbols functor functor functor category semantics functorial functorial functorial dagger condition functorial polymorphism functorial relationships functorial semantics functorial semantics of enrichment functorial strength functorial theory functors functors functors which preserve directed colimits functor-argument structures fundamental fundamental fundamental complexity measures fundamental definitions fundamental operations fundamental properties fundamental properties of infinite trees fundamental tool of algorithms from proofs funny rank in the sense of Eggan Furst Furst et al. fusion fusion closure Futamura Futamura projections future future behavior future input future interval logic fuzzy fuzzy fuzzy automata fuzzy relations fuzzy sets f-complete type assignments F-completeness F-domains F-easy subset f-factor f-factors of point sets F-Horn formulas F-models F-presentation F-semantics F-semantics of types F-semigroups F-soundness F-translations Ge´cseg Go¨bel Go¨del Go¨del incompleteness Go¨del numberings Go¨del speed-up Go¨del's Go¨del's result on non-recursive shortening of proofs Go¨del's second incompleteness theorem Go¨del's system T Go¨del-Bernays Gδ sets Gδ-extension theorems Gabbay Gabbay Gabbay's temporal fixed point operator Gabbrielli Gabbrielli Gabow Gabow and Tarjan Gaifman gains gains in computational efficiency Galil Galil Galil and Giammarresi and Restivo Galil and Giancarlo Galil's Galil's system of enumerating dags Galil-Seiferas algorithm Gallier Gallier Gallier Raatz and Snyder Gallier, Raatz and Snyder Gallin Gallin Gallo Gallo Galois Galois connection Galois connections Galois group Galois lattice theory Galois theory Galois theory for the tree automorphism problem Gambier game game game drinking glasses game of game of Daisies game of edge geography game of Go game of kriegspiel game of strategy game of twenty questions game technique game theory game value game with the earliest birthday games games games for the μ-calculus games of incomplete information games on graphs games-2142 game-theoretic operational semantics game-trees Γ language of Banâtre and Le Me´tayer γ-acyclic γ-acyclic BCNF database schemes γ-acyclic view Γ-controlled T-grammars Γ-recognizable subsets γ-reducibility γ-reducible to a sparse set γ-reduction γ-rules gap gap between gap between probabilisitc and deterministic LSA's gap between two successive keys gap cost functions gap theorem for gap theorem for recognizing regular languages gap theorem for resource bounded computations gaps in learning hierarchies gap-languages Gap-P garbage garbage garbage collection garbage collector garbage-theoretic properties Garey Garey and Johnson Gargov Gargov's Gargov's data analysis logic with local agreement Gargov's local agreement condition garph Garsia Garsia Garsia-Wachs algorithm Gary Gary and Johnson gas gas gas combustion gas dynamics Gasper gate gate gate delays gate functions gate operators gate races #-gates gates gates gates of low L1 norm gathering gathering possible interpretations Gauss Gauss elimination Gauss' lattice reduction algorithm Gaussian Gaussian Gaussian distribution Gaussian elimination Gaussian elimination algorithm Gaussian elimination algorithm for Gaussian limit laws Gaussian processes Gaussian random variables Gaussian stochastic processes Gauss-Jordan elimination Gauss-Markov processes GCD GCD GCD algorithm GCD of two polynomials GCD programs GCD's GCD's in rings of integers of algebraic number fields GCM GCM0-algorithms from proofs GCM>inf>0 GD GD0L systems gel Gelenbe Gelenbe and Finkel Gelfond Gelfond Gelfond and Lifschitz Genε gene genealogical genealogical minimum genealogy genealogy genealogy of a G-derivation generable generable languages general general context-free parsing algorithm general dependencies formalism general evaluation algorithm of the outermost type general logic programs general parallel computers general recursion general recursive functions generalization generalization formalism generalization inference mechanisms generalization of generalization of automatic sequences generalization of bisimulation equivalence generalization of continuous functions generalization of crossing sequences generalization of Datalog generalization of Dedekind's definition of completeness of the reals generalization of directed graphs generalization of DT0L systems generalization of finite automata generalization of Higman's well-quasi order result generalization of logic variables generalization of pumping lemmas generalization of recursive trees generalization of surreduction generalization of topological Markov chains generalization of traces generalization procedure generalization rule generalization theorem generalizations of generalizations of Cayley graphs of context-free groups generalizations of context free rewriting generalizations of context-free rewriting generalizations of finite automata generalizations of functional dependencies generalizations of reachability trees generalizations of the Ehrenfeucht conjecture generalized generalized generalized ε-approximation generalized automata on infinite trees generalized automaton generalized bound generalized Bruhat decomposition generalized calculus of constructions generalized closed world assumption generalized complexity cores generalized components generalized context free generalized context-free grammars generalized counter scheme generalized counting method generalized database generalized dimensions generalized domains generalized eigenvalue problem generalized equality sets generalized expressions generalized Fibonacci searches generalized form generalized framework generalized Galois theory generalized geography game generalized hierarchies of functions generalized high2 generalized hypercubes generalized inductive definitions generalized iterative algebraic theory generalized join dependencies generalized knapsack problems generalized Kolmogorov complexity generalized language equations generalized many-one reducibility generalized matrix reduction generalized matrix reduction method generalized membership problem generalized metric spaces generalized models generalized Moore shifts generalized natural transformations generalized net generalized Ogden's condition generalized parenthesis languages generalized parsing problems generalized partial computation generalized periods of strings generalized Petri nets generalized pigeonhole principle generalized Post correspondence problem generalized prefix generalized prefix order generalized processor optimization problem generalized product generalized program generalized proof principle generalized pushdown generalized push-down automata generalized queueing networks generalized regular expressions generalized relational algebra generalized relational calculus generalized relations generalized satisfiability problems generalized second order spectra generalized semigroup semirings generalized semi-monadic rewrite system generalized spaces generalized spectra generalized spectrum generalized star height generalized subsequence order generalized syntax-directed translation generalized topological generalized topological spaces generalized topological structures generalized truth-table reducibility generalized ultrametric generalized wedge operator generalized word problem generalized zeta function generalizing completeness results generalizing databases generalizing reduction generalizing total correctness general-purpose general-purpose algorithm general-purpose computer general-purpose pattern matching algorithms general-purpose program generated generating generating algorithm for trees generating codes generating concepts generating confluent rewrite systems generating description languages generating effective attribute evaluation programs generating engine of infinite sets generating external events generating function generating function of subpatterns generating functions generating functions of automata generating functions of automata from regular expressions generating graph languages generating graphs generating graphs from graphs generating Hamiltonian circuits generating HD0L systems generating ideals generating infinite words generating infinite words from selective substitution grammars generating Lyndon words generating mechanism for NLC grammars generating morphisms generating multiple closed tours generating ordered trees generating plans generating power generating power of generating power of grammars generating power of graph grammars generating power of lazy semantics generating power of NLC grammars generating power series generating prime generating self-affine fractals generating series generating set generating sets generating shift-register cycles generating system generating trees generation generation of generation of complex images generation of constant functions generation of fractal sets generation of induction subgoals generation of infinite arrays generation of invertible functions generation of large prime generation of large primes generation of permutations generation of random generation of random objects generation of random words generation of regular graphs, generation of two-dimensional pictures generation ordering generations generations of cells generative generative generative capacities of HG's generative capacity generative capacity of generative capacity of grammars generative capacity of MCFG's generative power generative power of generative power of colonies generative power of k-adjacency generative power of language families generative power of the k-adjacent derivations generator generator generator for a family of linear indexed languages generator of generator of a Horn spectrum generator of the family of context-free languages generator problem generator set generator set cardinality generator set of a group generators generators generators for over testable languages generators for permutation groups generators of generators of a semigroup generators of ational ω-power languages generators of groups generators of string languages generators of subset languages generators of the generators of the cone of context-free languages generators of the rational cone generators of trees generic generic generic absence of first integrals generic algorithm generic data types generic inputs generic number of solutions generic operations generic parsing paradigm generic pipelining transformation generic queries generic query generic random sets generic reduction generic sets generic software generic solution generic strip generic test sets genericity genericity genericity guarantees exactness genericity theorem genes genetic genetic algorithms genetics Genrich Genrich and Lautenbach Gentzen Gentzen Gentzen introduction rules Gentzen sequent calculus Gentzen sequents Gentzen systems Gentzen type propositional calculus Gentzen's Gentzen's Gentzen's rule Gentzen's system Gentzen-style system Gentzen-type axiomatization genus genus genus 1 genus k embedding genus of genus of a genus of a graph genus of a surface genus of maps genus of topological surfaces genus-1 maps genus-1 rooted maps geography geography generalized geography generalized arc geography generalized vertex geometric geometric geometric applications geometric automata geometric automata from regular expressions geometric BCH codes geometric characterization geometric concept geometric construction machine geometric construction of a superconcentrator of depth geometric constructions geometric containment geometric continuity geometric data structures geometric duals of polyhedra geometric embedding problems geometric hierarchy geometric incidence relations geometric information geometric logic for frames geometric objects geometric optimization geometric oracle machines geometric problem solver geometric problems geometric rewrite rules geometric sets geometric structure geometric structure of the set of zeros of a system of algebraic equations geometric transforms geometric weights geometrical geometrical geometrical decomposition operations geometrical interpretation geometrical transformations geometrically geometrically distributed variables geometries geometries of networks geometry geometry geometry and Euler identities geometry of geometry of conjunctive actions geometry of d-dimensions geometry of interaction geometry of singular points geometry theorems Gergely Gergely-Úry Gerhart Gerhart GHC ghost ghost ghost nodes ghost variables Giammarresi Giammarresi and Restivo Giancarlo Gibbons Gibbons and Rytter Gill Gill Gill and Bennet Gill's Gill's class PP Ginali Ginali Ginsburg Ginsburg Ginsburg and Rose Ginsburg-Rice Schu¨tzenberger Ginsburg-Rice Schu¨tzenberger ALGOL-like fixed-point theorem Ginsburg-Rice Schu¨tzenberger fixed-point theorem Ginsburg-Rice-Schu¨tzenberger fixed-point theorem Ginsburg-Rose theorem Ginzburg Ginzburg Girard Girard Girard polymorphic lambda calculus Girard second-order polymorphic λ-calculus Girard translation Girard translation of classical logic Girard's Girard's linear logic Girard's model of polymorphism Girard's proof nets Girard's system F Girard's system Fω Girard-Reynolds calculus Gire Gire GJM GJM-regularity global global choice global comparison global complexity global computation global computational problems global computations as ideals global conditions global confluence global consistency global controls global dependencies global fairness global finite-delay property global forbidding context global forbidding context for context free grammars global forbidding context for context-free grammars global function global illumination global information global model checking algorithm global motion planning global optima in optimization problems global optimization global optimization technique global partial order global relational consistency global representation of recursive functions global rewriting systems global serializability global serializability of concurrent programs global snapshots global specification global state global state fairness global state space global states global strategies global strategies of substitution global system availability global testing global time global topological size global variables globally globally globally convergent iterations globally deterministic synchronized tree automata globally legal state glued glued crowns gluing gluing gluing conditions Glushkov Glushkov Glushkov automaton Glushkov construction Glushkov-type product GN∞ inference GNF GNF GNF construction of Rosenkrantz GNF construction of Rozenkrants GNF grammar GNsup>∞ inference goal goal clauses goal formula goal region goals goals in clauses Gödel Gödel's Goguen Goguen Goguen and Burstall Goguen and Meseguer Goguen Jouannaud and Meseguer Goguen-Meseguer calculus Gold Gold Gold paradigm Gold's learning model Goldfarb Goldfarb's Goldfarb's theorem Goldmann Goldmann Goldmann et al. Goldreich Goldreich et al. Goldschlager Goldschlager et al. Goldschlager's Goldschlager's result Goldwasser Goldwasser Goldwasser et al. Goldwasser Micali and Rackoff Goltz Goltz Gonczarowski Gonczarowski and Gonczarowski and Shamir Gonczarowski and Warmuth Gonthier Gonthier et al. good E0L forms good ET0L forms good sets of basis transformations Goodenough Goodenough and Gerhart Goodeough Goodeough and Gerhart Goodman Goodman and Tay Goppa Goppa Goppa codes Goralchikova Goralchikova and Koubek Gordon Gordon and Shamir Gorn Gorn gorups gossip gossip problem gossiping gossiping GOTO goto goto goto constructs GOTO nodes goto nodes goto programming construct goto programs goto schemes Gouyou GPC GPC GPC processes GPC trees GPCP GPCP GPCP(2) GPCP(n) GPL GPL's Gr Gra¨del and McColm Gro¨bner Gro¨bner bases Gro¨bner bases computation Gro¨bner fans Gro¨bner walk graded graded hypothesis theories graded modalities gradual properties graft graft domain grafts grafts Graham Graham Graham et al. Graham reduction Graham-Harrison-Ruzzo version of Earley's recognition algorithm grain grained gramars Gramlich Gramlich grammar grammar grammar family grammar formalisms grammar forms grammar homomorphism grammar homomorphisms grammar isomorphism grammar isomorphism problem grammar manipulation grammar models grammar size grammar specifications grammar systems grammar transformations grammar/language layer grammars grammars grammars equivalence problem grammars for grammars for ω-languages grammars for intersctive models grammars for natural languages grammars in general categories grammars in toposes grammars of type X grammars on algebraic structures grammars with grammars with fewest possible number of nonterminals grammars with minimal number of nonterminals grammars with one letter terminal alphabeths grammars with one-letter terminal alphabeths grammars without nonterminals grammatical grammatical grammatical calculus grammatical characterization grammatical characterization of alternating pushdown automata grammatical codes grammatical codes for trees of arbitrary degree grammatical codes of trees grammatical complexity grammatical complexity measures grammatical complexity theory grammatical covering grammatical coverings grammatical inference grammatical inference problem grammatical interpretations grammatical methods grammatical model grammatical relations grammatical representation grammatical rules grammatical similarity relations grammatical structure grammatical target classes grammmar grams granularity granularity graph graph graph 3-colourability graph accessibility problem graph algorithms graph as a restricted 2-structure graph automata graph bipartitioning problem graph category graph codes graph colourability graph colouring graph compositions graph connectivity graph covering graph derivation graph derivation sequence graph derivations graph display graph drawing graph drawing problems graph driven BDD's graph driven BDDs graph editor graph embeddability problems graph embeddings graph families graph grammars graph grammars with neighbourhood-controlled embedding graph grammmar graph grammmar theory graph isomorphism graph isomorphism problem graph language graph language generating power of graph grammars graph languages graph L-systems graph manipulations graph model graph model of ACP?sup>ε graph model of Pω graph models graph nonisomorphism graph operations graph partition graph partition problem graph partition problems graph paths graph problems graph productions graph properties graph reachability graph representation of graph representation of a Boolean function graph representation of logic programs graph rewriting graph rewriting confluent graph rewriting language DACTL graph rewriting systems with priorities graph rewritings graph structures graph theoretic graph theoretic characterization of G-schemes and TL-schemes graph theoretic methods graph theoretic models graph theoretical structures graph theory graph transductions graph transformation graph transformation method graph transformers graph traversal techniques graph with colored vertices graphical graphical graphical language graphical representation graphical representations graphical representations of sets graphical specifications graphical syntax graphically graphics graphics graphlike graphlike expressions graphlike expressions in evaluation algorithms graphlike LISP expressions GraphLog GraphLog graphs graphs graphs as grammar forms graphs generalizing closed curves graphs of bounded graphs of bounded cyclic bandwidth graphs of bounded genus graphs of bounded path-width graphs of computable functions graphs of functions graphs on surfaces graphs with bounded bandwidth graphs with expensive depth reduction graphs with genus o(n) graphs with small separators graph-based regularity test graph-families graph-grammars graph-networks graph-oriented object data model graph-rewrite systems graph-rewriting formalism graph-theoretic characterization graph-theoretic structures graph-theoretical graph-theoretical path problems graph-theoretical properties graph-theoretical representation Grassl grate grate construction grates greatest common divisor greatest common divisor algorithm greatest fixed point greatest fixed point for inclusion greatest fixed point of a set functor greatest fixed point operators greatest fixedpoints greatest fixpoint greedy greedy algorithms greedy approximation algorithm greedy approximation algorithm duplication greedy approximation algorithm heuristics greedy approximation algorithm methods greedy heuristics greedy methods greedy-like algorithm greedy-style algorithms Green Green's Green's relations Greendlinger Greendlinger group Greibach Greibach Greibach normal form Greibach normal form construction Greibach normal form for context free string grammars Greibach normal form for context-free string grammars Greibach normal form grammars Greibach syntactic lemma grid grid grid drawings grid graphs grid interconnection network grid interconnection networks grid lines grid network topology grids Gries Gries's Grigorchuk Grigorchuk groups Grigoriev Grigoriev and Karpinski Gröbner Grodzki Grodzki Grolmusz Grolmusz Groote Groote and Vaandrager Grossberg Grothendieck Grothendieck Grothendieck fibration Grothendieck opfibration Grothendieck topology ground ground ground arguments ground atom sequences ground atoms ground complete set ground confluence ground confluence modulo some equations ground confluent ground co-reducibility ground domain ground equations ground field ground fields ground instances ground instances of atoms ground instantiation of a logic program ground markings ground negation ground reducibility ground reducibility property ground resolution ground rewrite system ground set ground solvability ground solvability of disunification problems ground stable model ground substitution ground system ground term ground term equation system ground term rewriting systems ground terms ground trees ground types grounded grounded grounded argumentation semantics grounded semantics groundedness grounding grounding out a disjunctive logic program groundness groundness conditions ground-co-reducible ground-reducible group group group algebra group algebra computations group algebra products group algebras of finite groups group automata group code group codes group factorization group families group identities group intersection group isomorphism group isomorphism problem group language group languages group of group of a problem group of all shift-self-equivalences group of automorphisms group of permutations group of servers group presentation group presentations group problems group quotient of a monoid group quotients of free monoids group theoretic problems group theory group type automata group with group with multiple operators group with universal presentation groupoid groupoid groupoids groupoids groupoids that are groups groups groups groups of automorphisms groups of finite elementary codes groups of permutations groups of units of monoids group-function group-language group-merge growing growing Abelian growing Abelian group growing Abelian monoid sequences growing D0L system growing groupoid sequences growing number of parallel processes growing systems growth growth growth equivalence growth functions in EDT0L languages growth of growth of D0L systems growth of filamentous organisms growth of problems for avoidable words GRS GRS Grundy Grundy values Gruska Gruska Grzegorczyk Grzegorczyk Grzegorczyk and Meyer generalized hierarchies Grzegorczyk generalized hierarchy Grzegorczyk hierarchy Grzegorczyk's hierarchy Grzegorczyk-class gsm gsm equivalence GSOS GSOS GSOS format guarantee guarantee constraints guarantee requirement guaranteed processes guard guard constraints guard contraints guarded guarded guarded access guarded clauses guarded commands guarded Horn clauses guarded recursion guarded recursive guarded repair guarded theories guarded theory guardedly guardedly specifiable in ACP with abstraction guardedness guards guards guard-commit mechanisms Guessarian Guessarian GUHA GUHA GUHA method GUHA system Guibas Guibas and Stolfi guingois guingois trees Gurari Gurari and Ibarra Gurevich Gurevich Gurevich and Harrington Gurevitch Gurvich Gurvich Gusfield Gusfield Guthrie Guthrie's conjecture Guthrie's problem g-completeness G-languages G-machines G-networks G-schemes Ha´jek Habel Habel et al. Hagino Hagino Hagino-Wraith style Haines Haines Haj Hájek Hajnal Hajnal et al. Hajós factorizations Haken Haken Hakmem Hakmem algorithm HAL HAL Hales Hales-Jewett theorem halfspaces half-plane half-space half-space intersection half-space retrieval problem half-spaces half-spaces in three-dimensional space Hall Hall Hall basis Hall topology Hall's condition for matchings Halpern Halpern Halpern and Moses Halstenberg Halstenberg and Reischuk halting halting halting configurations halting of Turing machines halting pebble automata halting problem halting problem on finite interpretations halting set halting space-bounded computations Hamilton Hamiltonian Hamiltonian circuit Hamiltonian circuit construction problems Hamiltonian cycle Hamiltonian cycles Hamiltonian cycles on dense graphs Hamiltonian path Hamiltonian problem Hamiltonian subgraphs Hamming Hamming Hamming codes Hamming distances hammock hammocks hammocks hammock-on-ears decomposition hammok hammok Handelman Handelman Handelman's theorem handler handler responses to an exception handlers handling of stacks handshaking handshaking handshaking communication Hankel Hankel Hankel determinants Hankel matrices Hankel-like results Hanoi Hansel Hansel hard hard combinatorial problems hard cores hard for co-NE hard instances of a problem hard logspace counting class hard minimum cost tension instance hard open problems hard polynomial hard problems hard promise problems hard set hard to compute hard to compute languages hard to compute polynomials hardest hardest function hardest integer to evaluate hardest polynomial to evaluate hardest problem hardest problems in complexity theory hardest sets hardness hardness hardness almost everywhere hardness function hardness of hardness of approximation hardness of communication complexity hardness of computing the trace of the matrix inverse hardness of factoring hardness of finding hardness of finding SAT problems with unique solutions hardness of finding specification morphisms hardness of maximum number of accepted packets hardness of minimum end-to-end delay hardness of NP problems hardness of SAT hardness proof hardness result hardness value hardware hardware hardware architecture hardware components hardware modification machine model hardware rings Hardy Hardy space hard-real-time preemptive task systems Harel Harel Harel Kozen and Parikh Harel, Kozen and Parikh Harju Harju and Harju and Karhuma¨ki Harju and Linna HARMONIC harmonic harmonic sums HARMONIC, server algorithm harmonics harmonics Harper Harper et al. Harrington Harrison Harrison Harrop Harrop subformulae Hartmanis Hartmanis Hartmanis and Hartmanis and Berman Hartmanis and Hopcroft hash hash hash function hash functions hashing hashing Hasse Hasse diagrams Hassner Hassner Hastad Hastad Hausdorff Hausdorff Hausdorff dimension Hausdorff distance Hausdorff extension Hausdorff property Hausdorff topologies Hausdorff-Kuratowski Hausdorff-Kuratowski difference hierarchy Hausdorff-Kuratowski hierarchy Haussdorf Haussler Haussler Haussler and Welzl having complete languages property having cross-sections freely property Hayashi Hayashi's Hayashi's PX Hayes Hayes' long-standing challenge hazards hazards HCFL HCFL hci hci-grammars HD HD0L languages HD0L sequence equivalence problem HD0L sequences HDT HDT0L languages Head head head Head and Lando head grammar head grammars head linear reduction head of rules head operation heads heads heads of rules heads versus tapes heads vs tapes head-normal form Heap heap heap data structure heap operations heap structure heaps HEAPSORT HEAPSORT heapsort heapsort heapsort algorithm heapsort algorithm HEAPSORT heart heart of a term heavily interdependent tasks Hebb Hebb Hecht Hecht and Ullman height height function height of height of a spanning tree height of a tree height of codes heights heights height-counting tree automata Heintz Heintz and Sieveking heirarchy hel Helios Hell Hell Hellenic Hellenic philosophers Hellman helping helping by robust oracle Turing machines helping in complexity theory Hemachandra Hemachandra Hemachandra and Allender Hemachandra and Cai hemisphere Henke Henkin Henkin Henkin quantifier elimination procedure Hennessy Hennessy Hennessy and Milner Hennessy's Hennessy's Hennessy's transition systems Hennessy-Milner logic Hennessy-Milner logic formula Hennessy-Milner logic with recursion Henschen Henschen Hensley Hensley Herbrand Herbrand Herbrand agent language Herbrand base Herbrand based semantics Herbrand bases Herbrand basis Herbrand basis conversion method Herbrand interpretation Herbrand interpretations Herbrand model Herbrand model equivalence Herbrand model semantics Herbrand model semantics of logic programs Herbrand models Herbrand system Herbrand system of constraints Herbrand universe Herbrand-Go¨del-Kleene systems Herbrand-Kleene universe Herbrand-Kleene universe for nondeterministic computations hereditarily hereditarily finite hereditarily finite permutators hereditarily finite sets hereditarily recursive operations hereditarily-finite sets hereditariness hereditariness for 2-structures hereditariness of primitivity hereditary hereditary hereditary graph property hereditary homogeneously orderable graphs hereditary permutators hereditary programs Hermite Hermite Hermite canonical form Hermite canonical form for a polynomial matrix Hermite canonical form of a polynomial matrix Hermite reduced lattice bases Hermite reduction of a matrix Hertrampf Hertrampf et al. Hertrampf's locally definable acceptance types Hessenberg Hessenberg form heterogeneous heterogeneous heterogeneous multiprocessor systems heterogeneous networks heterogeneous objects heterogeneous servers heterogeneous term algebras heterogenous heuristic heuristic heuristic algorithms heuristic methods heuristic problem solving heuristic search heuristic search algorithm heuristics heuristics heuristics for heuristics for binary search trees heuristics for minimum length partitions heuristics for optimum binar search trees heuristics for optimum binary search trees heuristics for record allocation heuristics for scheduling heuristics for systems of linear inequalities hexagonal hexagonal hexagonal deco polyominoes hexagonal division sequences hexagonal lattices Heyting Heyting's Heyting's rules HF HFA HFD HFD0L HFD0L languages HFD0L system HG HG HG's hidden hidden Markov model hidden Markov models hidden sorts hidden state estimation of mixed stochastic/nonstochastic systems hidden transitions hiding hiding operation hiding parts of theories hiding rules for restriction hiding synchronization hierachies hierachies with respect to evaluation costs hierachy hierarchic hierarchic derivor hierarchic derivor between order-sorted term algebras hierarchic development hierarchical hierarchical hierarchical abstract data types hierarchical combination hierarchical combinations of term rewriting systems hierarchical condition hierarchical consistency hierarchical data structure hierarchical database objects hierarchical definition hierarchical distributed computation hierarchical implementation hierarchical layers hierarchical memory model hierarchical networks of processes hierarchical procedures hierarchical radiosity method hierarchical relationships hierarchical representation of 2-structures hierarchical representations hierarchical representations of 2-structures hierarchical specification method hierarchical specifications hierarchical structures hierarchical systems hierarchical term rewriting systems hierarchical types hierarchical verification hierarchical verification of asynchronous circuits hierarchically hierarchically consistent and complete specifications hierarchically structured programs hierarchies hierarchies hierarchies for hierarchies for i-acceptance hierarchies for time-space complexity classes hierarchies of hierarchies of ω-regular sets hierarchies of classes of hierarchies of classes of languages hierarchies of concurrent systems hierarchies of families of SBTA-languages hierarchies of functions hierarchies of languages generated by cooperating grammars hierarchies of monoids hierarchies of primitive recursive word sequence functions hierarchies of programs hierarchies of regular ω-languages hierarchies of weak automata hierarchy hierarchy hierarchy induced by alternation hierarchy of hierarchy of ω-regular languages hierarchy of access levels hierarchy of agent-passing calculi hierarchy of aperiodic monoids hierarchy of balls hierarchy of classes Hk hierarchy of communicating processes hierarchy of complexity classes hierarchy of computable functions hierarchy of counting functions hierarchy of cyclic graph languages hierarchy of degrees hierarchy of eNCE families of graph languages hierarchy of families of languages hierarchy of faulty processes hierarchy of graph languages hierarchy of inductive inference machines hierarchy of k-context-free-languages hierarchy of languages hierarchy of layers hierarchy of modular tree transductions hierarchy of Muller automata hierarchy of name-passing calculi hierarchy of nets hierarchy of non-context-free languages hierarchy of one-way multihead automata languages hierarchy of polynomial time lattice basis reduction algorithms hierarchy of program control structures hierarchy of propositional hierarchy of propositional Horn formulas hierarchy of propositional sequent calculi hierarchy of P-reducible degrees hierarchy of queries hierarchy of Rabin indices hierarchy of restrictions hierarchy of super-nets hierarchy of S-communication complexity hierarchy of temporal logics hierarchy of timed models hierarchy of Turing functions hierarchy of universes hierarchy of user domain restrictions in data bases hierarchy of weak indices hierarchy of wordsequence functions hierarchy result hierarchy theorem high complexity high complexity of programming high degree of independence of tasks high degree of nondeterminism high degree of parallelism high hierarchies high language generating power high level high level access to distributed data structures high level declarative programming high level declarative query languages high level dependency rules high level formal description of parsers high level functional languages high level model high level parallel programming high level Petri net model high level Petri net model of concurrent systems high level Petri nets high level replacement systems high level temporal operators high order differences high performance high performance Fortran compiler high probability high proportion higher bifurcation ratios higher complexity classes higher dimensional objects higher dimensions higher level higher level grammars higher level transition systems higher moments higher order higher order λ-calculus higher order π-calculus higher order algebraic higher order algebraic rewriting higher order algebraic rules higher order algebras higher order algorithms higher order calculus higher order concurrent higher order concurrent λ-calculus higher order concurrent calculi higher order constants higher order dataflow schemes higher order designs higher order equations higher order extension of the propositions-as-types paradigm higher order functional higher order functional programming languages higher order functional programs higher order functions higher order lambda calculi higher order languages higher order logic higher order logic programming language higher order logics higher order objects higher order operation higher order polymorphic λ-alculus higher order programming higher order programs higher order relations higher order resolution method higher order rewriting higher order rewriting systems higher order rules higher order specifications higher order specifications partial higher order specifications higher order subtyping higher order term rewriting systems higher order terms higher order type theory higher order typed λ-calculi higher order types higher order unification higher order universal algebra higher orderlogical formulae higher type higher type equational higher type equational calculus higher type equational classes higher type Horn classes higher type primitive recursive definitions higher type recursive operators higher types higher-dimensional word problems higher-level higher-level nonprimitive operators higher-level specifications higher-level synchronizing devices in MEIJE-SCCS higher-order higher-order λ-calculus higher-order π-calculus higher-order algebraic higher-order algebraic rewriting higher-order algebraic rules higher-order algebras higher-order algorithms higher-order calculus higher-order concurrent higher-order concurrent λ-calculus higher-order concurrent calculi higher-order constants higher-order equations higher-order extension of the propositions-as-types paradigm higher-order functional higher-order functional programming languages higher-order functional programs higher-order functions higher-order lambda calculi higher-order languages higher-order logic higher-order logic programming language higher-order operation higher-order polymorphic λ-alculus higher-order programming higher-order programs higher-order relations higher-order resolution method higher-order rewrite system higher-order rewriting higher-order rewriting systems higher-order rules higher-order specifications higher-order subtyping higher-order term rewriting systems higher-order terms higher-order type theory higher-order typed λ-calculi higher-order types higher-order unification higher-order universal algebra higher-orderlogical formulae highest degree subgraph highest degree subgraph problem highly interconnected computational problems high-dimensional meshes high-dimensional meshes of optical busses high-dimensional space high-level high-level access to distributed data structures high-level declarative query languages high-level formal description of parsers high-level functional languages high-level model high-level model of computation high-level parallel programming high-level Petri net model high-level Petri net model of concurrent systems high-level Petri nets high-level replacement systems high-level temporal operators high-order discretization of geometric data Higman Higman Higman's Higman's theorem Higman's well-quasi order result Hilbert Hilbert matrices Hilbert's Hilbert's tenth problem Hilbertian Hilbertian field Hilbert-style Hilbert-style axiomatizations Hilbert-style proof system Hilbert-style proofs Hilbert-style systems Hillman Hillman-Grassl algorithm Hindley Hindley Hindley/Milner type system histogram histogram historical historical data for objects histories histories history history of history of past event occurrences history of tokens history-preserving history-preserving bisimulation history-preserving equivalence Hitchcock Hitchcock-Park theorem Hitchcock-Park theorem on derivatives hitting hitting set hitting set problem HL HL HLR HLR conditions HLR conditions high level replacement HMM HMM HNN HNN extensions Hoare Hoare Hoare asserted programs Hoare axiomatic proof formalism Hoare et al. Hoare logic Hoare logic inference rules Hoare power domain Hoare powerdomain Hoare's Hoare's calculus Hoare's chaos semantics Hoare's logic Hoare's logic for Hoare's logic for nondeterministic regular programs Hoare's logic for programming languages Hoare's logic for while-programs Hoare's logic in proving correctness of nondeterministic programs Hoare's logic over PA Hoare's program FIND Hoare's proof system Hoare-derivable Hoare-He postspecification operators Hoare-like Hoare-like logic Hoare-like proof systems Hoare-like system Hoare-like verification system Hodgson Hodgson Hoffman Hoffman and O'Donell's simple patterns Hoffmann Hoffmann-Lawson duality holding holding costs holomorphic holomorphic holomorphic function holomorphic functions outside the unit disk holonomic holonomic control systems holonomy holonomy decomposition holonomy decomposition of transformation semigroups holonomy decomposition theorem Holt Holt home home state property home states homeomorphic homeomorphic subgraph problem homeomorphism homeomorphs Homer Homer Homer's homing homing determinacy homogeneity homogeneity homogeneity of systolic automata homogeneous homogeneous homogeneous decomposition of stochastic systems homogeneous graphs homogeneous polynomials homogeneous reversible automata homogeneous sets in 2-graphs homogeneous systems homogeneous whirl decomposition homogeneous whirl decomposition of stochastic systems homogeneously homogeneously orderable graphs homologica finiteness condition homologica finiteness condition FP∞ homological homological algebra homomorphic homomorphic homomorphic characterization of homomorphic characterization of context-free languages homomorphic characterization of contex-free languages homomorphic characterization of queue languages homomorphic characterization of recursively enumerable languages homomorphic characterizations homomorphic characterizations of context-sensitive languages homomorphic equality homomorphic equality operations homomorphic image homomorphic image of homomorphic image of a D0L system homomorphic image of languages homomorphic images homomorphic images of homomorphic images of context free languages homomorphic images of context-free languages homomorphic images of languages homomorphic images of parses homomorphic images of sentential form languages homomorphic images of sequential form languages homomorphic map homomorphic realization of automata homomorphic relations homomorphic replacements homomorphic replacements of variables homomorphic replication homomorphic representation power homomorphic representations homomorphically homomorphically complete homomorphism homomorphism homomorphism of free semigroups homomorphism theorem for sketches homomorphism tree transformations homomorphisms homomorphisms homomorphisms based on erasure homomorphisms between posets homomorphisms for languages homomorphisms of homomorphisms of D0L systems homomorphisms of languages homomorphisms of rings homomorphisms of semantics homomorphisms of unary partial algebras homorphic homorphisms homorphisms of D0L systems homothetical homothetical image homotopies homotopies homotopy homotopy homotopy algorithms homotopy construction methods homotopy continuation concepts homotopy methods honest honest explanations honest m-degrees honest polynomial degrees honest polynomial-time Turing reducibility honest reductions honest subrecursive classes honesty honesty theorem Hoofman Hoofman hook hook generating functions Hopcroft Hopcroft Hopcroft and Pansiot Hopcroft and Ullman Hopcroft's Hopcroft's Hopcroft's algorithm Hopcroft's fast partitioning algorithms Hope Hopf Hopf algebra Hopf algebra structure Hopfield Hopfield model Hopfield version of the traveling salesman problem horizontal horizontal horizontal bar horizontal operations Horn Horn Horn clause Horn clause languages Horn clause logic Horn clause logic basis Horn clause programs Horn clause theories Horn clauses Horn clauses languages Horn clauses queries Horn DNF Horn equational theory Horn formula Horn formula with uncertainty Horn formulas Horn formulas in first-order logic Horn functions Horn logic Horn logic programs Horn programs Horn sentences Horn set Horn spectra Horn theory of iteration Horn-clause logic Horn-clause logic with equality Horn-equational axiomatization Horn-SAT problem Horowitz Horowitz and Sahni Horspool Horspool's Horspool's variant of Boyer-Moore string searching Horton Horton-Strahler number horvert horvert-representation Horwitz Horwitz Host host host Host and Queffe´lec host language host programming language hot switches Hotz Hotz Hotz group Hotz monoid hot-potato routing hot-potato routing model Hough Hough transform house house-hole-domino-sun-free graphs Howard Howson Howson property Howson property of free groups HP hp HPF HPF compiler HPF language HPF runtime system hp-T degrees HRO HRO Hromkovic Hromkovic Hromkovic et al. HRS HRS HRS's HS HS Hu Hu and Hu and Hwang Hu and Tucker Hu, Chen and Hwang Huet Huet Huet and Huet and Hullot Huet and Hullot's principle of definition Huet and Oppen Huffman Huffman Huffman tree problem Huffman trees Hughes Hughes supercombinators hull Hullot Hullot Hullot's hulls hulls Hungarian Hungarian algorithm Hunt Hunt and Stearns Hurkens Hurkens et al. Hurwitz Hurwitz Hurwitz product of Hurwitz product of automata Hurwitz product of formal power series Hurwitz product of matrices Hutchinson Hutchinson Huynh Huynh and Tian Hu-Tucker algorithm hv-local picture languages Hwang hybrid hybrid hybrid algorithms hybrid atomicity hybrid control systems hybrid dynamic systems hybrid realtime embedded systems hybrid reorganization scheme hybrid scheme hybrid systems hybrid systems models hybrid task systems hybridization hybridization Hyland Hyland Hyland and Pitts Hyland's Hyland's characterization of equality hyper hyper (1)-AFL, full ~ hyper(1)-AFL hyperarcs hyperbolic hyperbolic iterated function system hypercube hypercube hypercube network topology hypercube networks hypercube of cliques hypercube representation of many-variable polynomials introduced by Beauzamy-Frot-Millour hypercubes hypercubes hypercubic hypercubic networks hyperdoctrine hyperedge hyperedge channel hyperedge channels hyperedge replacement hyperedge replacement grammars hyperedge replacement graph-grammar hyperedge replacement jungle rewriting hyperedges hyperedges hyperedges of rank hyperedge-labelled hypergraphs hyperedge-replacement hyperedge-replacement grammars hyperedge-replacement graph grammars hypergraph hypergraph hypergraph 2-colourability hypergraph grammars hypergraph languages hypergraphs hypergraphs hyperhypersimple hyperhypersimple set hypermap hypermap hypermap grammars hypermap languages hypermap rewriting hypermap with perscribed automorphism group hypermaps hypermaps hyperpaths hyperpaths hyperplanes hyperplanes over finite fields hypersimple hypersimple set hyperspace hyperspace of compact subsets hypertext hypertext hypertext links hypertext software hyperuniverses hyperuniverses hyper-AFL hyper-algebraic extensions hyper-algebraic extensions of languages-families hyper-algebraic language hyper-algebraic languages hyper-sentential extension hypotheses hypotheses Hypothesis hypothesis hypothesis hypothesis of well-foundedness hypothesis space hypothesis theories hypothesis theory hypothetical hypothetical hypothetical addition hypothetical DATALOG hypothetical reasoning hypothetical rulebases H-grammars H-graphs h-out of-k mutual exclusion h-out of-k mutual exclusion algorithm H-resolution H-systems i.s.r. systems, information storage and retrieval systems I/O automata I/O automata operation I/O automata performance I/O automata requests I/O in Pascal IAG IAG Ianov Ianov equivalence Ianov's Ianov's schemes Ibarra Ibarra Ibarra and Trân Ibarra et al. Ibarra's Ibarra's result for multihead automata ice ice pile model ID ID ideal ideal ideal bases ideal completion ideal completion of an abstract basis ideal completions ideal in a monoid ideal mental models ideal of ideal of identities of matrices ideal of left simple polynomials ideal tree ideals ideals in ideals in a ideals in a finite algebra ideals in a preorder ideals in algebras ideals in Lie algebras ideals of ideals of a computation diagram ideals of partial orders ideals of pomsets idempotence idempotence idempotent idempotent idempotent in monoids idempotent monoids idempotent relator idempotent semigroups idempotent substitutions idempotents idempotents idempotents/generators identical adjacent blocks identical communicating identical communicating automata identical communicating processes identifiability identifiable identification identification identification criteria identification criteria for machine inductive inference identification in the limit identification of grammars identification of languages identification of programs identification of programs for functions from their graphs identifier identifier identifier experiments identifiers identifying identifying classes of programs identifying problems identities identities identities for manipulating decision trees identities in free partially commutative monoids identities matrices identities partially commutative words identity identity identity λx identity combinator identity function identity functions identity functor identity relation identity set identity sets of data types identity substitutions idle loops if then else and while do constructs if then else and while do constructs, IFS IFS if-goto statements IF-statements if-then-else if-then-else control structures if-then-else operator if-then-else operator in Prolog dialects if-then-else programming construct if-then-else-fi if-then-else-programs ignoring synchronization ILD Ilie Ilie illumination ill-conditioned matrices ill-conditioning ILO ILO image image image arrows image identification algorithms image language image of a image of a rational relation image of a univariate sparse polynomial image processing image processing tasks image s# images images images of hp-T degrees image-finite processes imaginary imaginary vertices imaging imbalanced imbalanced nodes imbedding Imielinski Imielinski and Lipski immediate consequence immediate consequence operator immediate consequences operator immediate-start patterns Immerman Immerman Immerman-Szelepcse´nyi theorem immigration immigration immune immunity immunity impartial impartial impartial arc geography impartial combinatorial games impartial two-person game impartial vertex geography game imperative imperative imperative ALGOL-like setting imperative concurrent programming language imperative functional imperative functional program imperative functional programs imperative higher-order programming languages imperative host language imperative interpretations imperative language imperative language loop imperative languages imperative parallel language imperative programming imperative programming facilities imperative programming language imperative programs imperative variants of functional languages imperative-functional programs imperfect imperfect imperfect control imperfect knowledge implementability implementability of data abstractions implementable implementable implementable algebras implementable functors implementation implementation implementation definitions implementation errors implementation for implementation for algorithms implementation for DLP implementation in CSP implementation in Newton implementation language implementation mapping implementation method implementation of implementation of a module in terms of another module implementation of abstract data types implementation of Carter-Wegman universal hashing implementation of data abstractions implementation of distributed systems implementation of functional features implementation of functional languages implementation of graph algorithms implementation of Helios implementation of item notation implementation of logic programming implementation of multi-writer atomic registers implementation of parametrized data types implementation of processes implementation of programming languages implementation of sets by hash-tables implementation of SMS implementation of term rewriting implementation of the implementation of the Brent-Kung algorithm implementation of the Cantor-Zassenhaus algorithm implementation of the Painleve´ test implementation of universal hashing implementation of virtual processing implementation preorder implementation proofs implementation relations between specifications implementation space implementation theorem implementational implementational algorithm implementations implementations implementations of implementations of inputs implementations of ω-inputs implementations of functional languages implementations of graph algorithms implementations of linear lists implementations of loop networks implementations of open ear decomposition implementations of parametrized data types implementations of programming languages implementations of Prolog implementations of the implementations of the λ-calculus implementations of the semantics of programming languages implementative implementative considerations implemented implemented with a bounded stack implementing implementing atomic data types implementing binary trees over arbitrary data implementing dynamic algebraic dependencies implementing programming languages implementing term rewrite languages implementing term rewrite languages in dactl implementing term rewrite languages, implicant implicants implication implication implication connective implication connective of predicate logic implication for constraint systems implication goals implication in predicate logic implication of clauses implication problem implication rules implicational implicational implicational dependencies implicational dependencies of Fagin implicational dependency implicational fragment of linear logic implicational languages implicational logics implications implications implications over lattice structures implicit implicit data implicit data structure implicit data structures implicit definition implicit dictionaries implicit dictionary problem implicit equations implicit language equations implicit language equations operations implicit polymorphism implicit relations implicit specifications implicit specifications of concurrent systems implicit specifications of type implict error propagation rule impossibility impossibility of impossibility of reducing NPOP's impossibility of the homomorphic characterization of context-sensitive languages impossibility proof imprecise imprecise data impredicative impredicative impredicative second order arithmetic impredicative system impredicative theory impredicative theory of operations control and classes impredicative type theories imprimitive imprimitive word improved algorithms for recognizing transductions improved lower bounds for evaluating polynomials improvement theorem in ground negative in ground negative literals in networks inaccessible inaccessible cardinal inaccuracies inaccuracies inaccurate inaccurate information incidence incidence incidence graph of a projective plane incidence matrix incidence relation incidence relations inclusion inclusion inclusion and exclusion principle inclusion between relational database schemata inclusion constraints inclusion diagram inclusion functor inclusion of inclusion of observable properties inclusion of tree transformation classes inclusion order inclusion problem inclusion problem for inclusion problem for deterministic multitape automata inclusion problem for LL(k) languages inclusion problem for sets of firing sequences inclusion problem for simple languages inclusion problem for vector addition reachability sets inclusion problem for vector addition system reachability sets inclusion relation inclusion relationship inclusion star height inclusion theorems for grammars inclusions inclusions inclusions between inclusions between expressions inclusions between type constants inclusions of language families inclusions of observable properties inclusive inclusive predicates incomparabilities incomparabilities of language families incomparability incomparability of nondeterminism and universality incomparable incomparable incomparable constraints incomparable synchronization protocols incomplete incomplete incomplete data incomplete databases incomplete environment incomplete formalized proof methods incomplete information incomplete information database incomplete knowledge incomplete on flat relations incomplete partial ordering incomplete specifications incompleteness incompleteness incompleteness of incompleteness of first-order temporal logic with until incompleteness of temporal systems incompleteness results incompleteness results for first order temporal logic incompleteness results for first-order temporal logic incompleteness theorem incompleteness theorems incompressible incompressible incompressible on average incompressible string inconsistencies inconsistencies caused by fixpoints inconsistencies of fixpoints with coproducts inconsistency inconsistency inconsistency of inconsistency of fixpoints with coproducts inconsistency of propositional formulas inconsistent inconsistent inconsistent algorithms inconsistent databases inconsistent first-order set theory incorporating incorporating strictness constraints incorrectness incorrectness of a program specification incr increasing increasing increasing data complexity increasing generalized Sierpinski grammars increasing generalized Sierpinski grammars in increasing sequence of probability distributions increasing sequences of finite arrays increasing subsequence incremental incremental incremental algorithm incremental attribute evaluation incremental compilation incremental complexity incremental computation incremental concept formation approach incremental constraint satisfaction incremental constraint solver incremental efficiency incremental learning incremental learning of logic programs incremental satisfaction of FD's incremental simulation incremental time complexity incremental version incr-LOGSPACE incr-POLYLOGTIME-complete Ind + Tord models indecomposable indecomposable indecomposable finite number of indecomposable codes indecomposable k-structure indecomposable soliton automata indecomposable substructure indefinite indefinite indefinite databases indefinite information indefinite temporal constraint databases indegree indegree of a superconcentrator independence independence independence between clauses independence of independence of actions independence of inequations independence of P = NP independence of Rabin's theorem independence of Rabin's theorem independence of regular languages independence of tasks independence parallel independence of derivation steps independence relation independence relations independence results independence results in compexity theory independence results in complexity theory independence results related to P =? NP independence structuredness independences independent independent independent actions independent bases independent basis independent clauses independent complete restrictions independent connections independent domination problem independent factors independent letters independent random independent random oracles independent random variables independent recursion variables independent representation of constraints independent schemes independent sequence independent set problem independent sets independent sets in planar graphs independent subtrees independent systems of equations in semigroups independent task-farm topology independent traces independent waiting-time constraints Indermark indeterminacy indeterminacy indeterminates indeterminates indeterminism index index index of index of congruences index of periodic systems index productions index set index sets indexed indexed categories indexed categories in semigroup theory indexed families of indexed families of functions indexed families of uniformly recursive languages indexed functor indexed functors indexed grammars indexed languages indexed types indexes indexes indexing indexings indexings indexings of subrecursive classes indication indices indices indifference indifference graphs indirect binary cube networks indiscernibility indiscernibility relations indiscernibility relations logic indistinguishability indistinguishability indistinguishability assumption indistinguishability relation individual individual agents individual patterns individual terms INDL INDL induced induced induced distance functions induced domain induced metrics induced partial order induced subgraph induced subgraph isomorphism problem induced subgraph isomorphism problem for outerplanar graphs induced transition system induction induction induction axioms induction formula induction hypothesis induction on the length of terms induction principle induction principles induction principles supporting verification induction rule induction rules induction variables inductionless inductionless induction methods inductions inductions induction-free proofs inductive inductive inductive assertion method inductive assertion method for logic programs inductive closure inductive datatypes inductive definition with Horn clauses inductive definitions inductive fixed points inductive formalization of sample computations inductive function inductive generalizations inductive graph inductive graph predicate inductive graph properties inductive inference inductive inference algorithms inductive inference from noisy data inductive inference machines inductive inference of programs of recursive functions inductive inference of programs of recursive functions from input/output examples inductive inference of programs of recursive functions probabilistic strategies in inductive inference inductive inference rule inductive learning inductive methods inductive posets inductive proof inductive queries inductive query inductive reasoning inductive semantics inductive sets of evaluations inductive specification method inductive synthesis of programs inductive theorem proving inductive theorems inductive theory inductive types inductive valuations inductively inductively completing a theory inductively defined inductively defined sets inductively defined types inductive-read-k subclass ineffable inefficiency of resolution inefficient algorithms inefficient algorithms in inequalities inequalities inequalities in linear programming inequality inequality inequality conditions inequality system inequational inequational properties of iteration inequations inequations inequivalence inequivalence inequivalence problem inequivalent inequivalent synchronization trees inertness inevitability inevitability proofs inevitability properties inevitability properties of transition systems inevitable inevitable behaviour of a process inevitable properties inevitable property of system states inexpensive run-time error inexpressible inexpressible in declarative semantics inexpressiveness inexpressiveness inf function inference inference inference algorithms inference algorithms in inference basis inference basis of a set of MVD's inference by deterministic strategies inference control inference control technique inference of inference of approximate programs inference of function classes inference of optimal descriptions inference of programs inference of tree languages inference of types inference operator inference problem inference problem for dependencies inference process inference rule inference rules inference rules for inference rules for embedded multivalued dependencies inference rules for embedded multivalued dependencies inference rules for join dependencies inference rules for multivalued dependencies inference rules for multivalued dependencies in database relations inference semantics inference system inference systems inferences inferences inferences for numerical inferences for numerical dependencies inferences from a single dependency inferences of multivalued dependencies inferences of multivalued dependencies inferencing inferencing mechanism inferred properties inferring a inferring a DNA sequence inferring a tree from walks inferring tree languages inferring valid logical models infima infima infimal infimal solution ∞-regular languages ∞-regular temporal logic infinitary infinitary infinitary algebras infinitary axiomatization for PDL infinitary closure conditions infinitary codes infinitary conditional equational logic infinitary conjunctions infinitary deterministic rational language infinitary extension infinitary formal language S-TL infinitary free monoid infinitary lambda calculus infinitary language infinitary languages infinitary logic infinitary logic formulas infinitary operations infinitary proof infinitary proof rule infinitary proof system infinitary quasi-variety infinitary ratinal relations infinitary recursion theorems infinitary regular temporal logic infinitary relations infinitary rewriting infinitary rule infinitary signature infinitary term model infinitary theories infinitary traces infinitary type infinite infinite infinite alphabets infinite arity infinite arity in MEIJE infinite arrays infinite atoms infinite automata ω-language infinite basis of combinators infinite behavior infinite behavior of finite-state systems infinite behaviors infinite behaviors of finite automata infinite behaviour infinite behaviour of infinite behaviour of deterministic infinite automata infinite behaviour of infinite automata infinite behaviour of Petri nets infinite behaviours infinite behaviours in CSP infinite binary infinite binary sequences infinite binary tree infinite cancellative semigroups infinite class infinite class of languages infinite complete binary tree infinite complexity infinite complexity hierarchies infinite computation infinite computation tree infinite computation trees infinite computations infinite computations in infinite computations in constraint infinite computations in constraint programming infinite computations in denotational semantics infinite computations in languages with iterations infinite concurrent processes infinite confluence system infinite confluent system infinite conjunctions infinite context free language infinite context-free language infinite data type infinite decimal fractions infinite degree of ambiguity of an NFA infinite derivations infinite derivations in generalized context-free Kolam array grammars infinite disjunctions infinite distance infinite domain infinite event sequences infinite expressions infinite fair computations infinite families infinite families of irreducible synchronization infinite Fibonacci infinite Fibonacci string infinite Fibonacci word infinite field infinite flow charts infinite game infinite games infinite grammar form infinite graphs infinite hierarchies of infinite hierarchies of classes of context-sensitive languages infinite hierarchies of control structures infinite hierarchies of recursive languages infinite hierarchy infinite hierarchy of control structures infinite hierarchy of tape bounded complexity classes infinite hierarchy theorem infinite hypergraphs infinite incidence matrix infinite input tapes infinite internal computation infinite interpretation infinite labelled or unlabelled firing sequences infinite length infinite length of the data infinite length words infinite linear infinite linear Gauss-reduced basis infinite linear Gauss-reduced basis conversion method infinite linear language infinite linear systems infinite loop infinite loop matrix infinite memory infinite nondeterminism infinite non-repetitive words infinite normal forms infinite normal forms for term rewriting systems infinite NP set infinite NP set sets infinite number infinite numbers infinite objects infinite options infinite order infinite P subset infinite paths infinite polynomial complexity core infinite power series infinite precision infinite processes infinite product infinite products infinite proper polynomial complexity core infinite protocol automata infinite protocol automata from regular expressions infinite pseudorandom sequences infinite pseudo-random sequences infinite pure flowchart infinite pure flowcharts infinite quotient monoid infinite Ramsey theorem infinite recursive graph infinite regular infinite regular subsets infinite regular Thue systems infinite regular trees infinite repeating infinite repeating construct infinite repetitions infinite repetitions of elements infinite right completions infinite rule set infinite schedule infinite semantics infinite sequence of inferences infinite sequence of inputs infinite sequences infinite sequences of infinite sequences of ε moves infinite sequences of letters infinite sequences of symbols infinite sequences of words infinite sequences ofsymbols infinite sequences without repetition infinite set infinite sets of infinite sets of graphs infinite sets of ground clauses infinite sets of rewrite rules infinite sets of rules infinite sets of terms infinite signatures infinite sla language infinite snakes infinite squarefree D0L languages infinite squarefree word problem infinite square-free infinite square-free complement infinite square-free D0L languages infinite square-free sequences infinite square-free word problem infinite standard Sturmian words infinite state infinite state automata infinite state space infinite state spaces infinite state streams infinite strings infinite strings of digits as real numbers infinite structures infinite subset infinite subset of P infinite sum operators vs non-guarded definitions infinite synchronous network infinite synchronous network of finite automata infinite syntactic infinite syntactic development infinite syntactic hierarchy infinite systems infinite term infinite term rewriting system infinite terms as limits of infinite converging derivations infinite Thue systems infinite tournaments infinite traces infinite tree infinite tree automata infinite tree languages infinite tree logic programming infinite trees infinite trees in semantics infinite two-person games infinite unfolding process infinite value set infinite weakly fair occurrence sequence infinite word infinite word languages infinite word of Thue-Morse infinite words infinite words with linear subword complexity infinitely infinitely branching trees infinitely long infinitely long computations infinitely long lists infinitely long objects infinitely long proofs infinitely many answers infinitely many isomorphic proper subgroups infinitely-flat semi-circular polygons infiniteness infiniteness problem infinitesimals infinitesimals infinite-trace infinite-trace monoids infinite-valued infinite-valued calculus of Lukasiewicz infinite-valued distance automaton infinite-valued logic infinite-word languages infinity infinity infinity of complete prefix codes infite infix infix infix code infix codes infix operator precedences infix-outfix code inflationary inflationary inflationary fixpoint logic inflationary interpretation of bounded fixpoints influence influence influence of noise and speed information information information about contexts information base information coded by strings of indices information content information content characterization information dissemination process information domains information exchange information flow information logic information logics information processing information rate information rate of graphs information repositories information retrieval information retrieval systems information sequence information sharing information source tracking information storage information storage and and retrieval information structure of a data space information structuring information system information systems information theory information theory bound information theory bound in sorting information transfer information transfer in VLSI circuits information transfer primitives information transmission informational informational objects information-theoretic information-theoretic characterizations of recursive infinite strings inf-faithful domains inf-faithful domains ~ inherent inherent ambiguity inherent relative computational complexity inherent trade-off between the complexities of the update and retrieve transactions inherently inherently ambiguous inherently ambiguous context-free languages inherently ambiguous E0L languages inherently E0L-ambiguous inherently exponentially bounded problems inherently non-deterministic inherently unambiguous sets inheritance inheritance inheritance hierarchy inhomogeneous inhomogeneous inhomogeneous Markov chain inhomogeneous queues Init Init language operator initial initial initial acyclic part of a graph initial algebra initial algebra semantics initial algebra specification initial algebra theorem initial algebras initial collision initial configurations initial constraints initial continuous dynamic algebra initial cpo initial datatypes initial dictionary initial fragments initial goals initial higher type algebras initial index initial many-sorted algebra initial marking constraints initial model initial model construction initial model semantics initial models initial occurrences initial positions initial program initial program executions initial semantics initial set initial solution of domain equations initial solutions initial state initial state invariance initial string initial strings initial subtrees initial term initial tree initial values initiality initiality initiality theorems initial-algebra models initiator initiator site initional injections injections of summands injective injective injective automata injective automata from regular expressions injective cellular automaton injective mapping injective objects injectivity inkdot inlet inlet-outlet pair inner inner compatibility inner information inner product algorithm inner products innermost innermost innermost normalization innermost simple programs innermost termination innocent critical pairs inorder inorder traversal Inoue Inoue Inoue and Takanami Inoue et al. input input input clauses input data input data space input domain input elements input formula input graph input graphs input head input language input length input matrix input node input parameters input pattern input prefixes input read-modes input read-modes of alternating Turing machines input relabeling input relation input size input string input strings input symbol input tape input tapes input terminals input tree input types input variables input vectors input word input/output automata inputs inputs input-lookahead input-output input-output automata input-output behavior input-output correctness theories input-output function input-output maps of dynamical systems input-output operational behaviour of logic programs input-output pairing input-output pairs input-output relation input-output relations input-output semantics input-output sequential machines input-output set input-output specifications insensitivity insensitivity inserting inserting new arcs inserting records inserting vertices insertion insertion closed language insertion closure of languages insertion costs insertion heuristic insertion methods insertion sort insertion/deletion of vertices insertion/deletion of vertices and edges insertion/deletion time insertions insertions of new hyperarcs insertion-base of a language inside-out reductions instability instability installation instance complexity instance complexity measure instance complexity of a string instances instances of NP-complete problems instances of SAT instances of SAT with unique solution instances of satisfiability instances with unique solution instanciation instant instantaneous instantaneous instantaneous aspects of semantics instantaneous communications instantaneous synchronization events instantiable instantiable variables instantiation instantiation instants institution of Horn clause logic institutions institutions for logic programming institutions with submodels institution-independent instruction instruction base instruction executions instruction set instruction sets instructions instrumentation instrumentation overhead insubstantiality insubstantiality of insubstantiality of processes insubstantiality of processess insurmountable insurmountable bounds integer integer integer base integer coefficients integer divisibility problems integer division integer division by two integer functions integer gap-order constraints integer labels integer linear equations integer matrix integer multiple-choice knapsack packing problem integer multiplication algorithms integer optimization problem integer order constraints integer part function integer programs integer root integer sequence integer sequences integer sorting integer valued matrices integer vertex labelling integer weight integer -order constraints integers integers integers mod p integers modulo m integrability integrability in the sense of Painleve´ integrability of integrability of ordinary non-linear differential systems integrability of partial non-linear differential systems integral integral integral companion matrices integral domain integral of a bounded real-valued function integral part of a number integral positions integral representations integral transform integral transforms integrals integrals Integrated integrated Integrated costs integrated costs integrating integrating integrating mathematical software packages integrating processes integration integration integration in finite terms integration of codes integrity integrity integrity constraints integrity monitoring intelligence intended model intended type intended type equalities intensional intensional intensional behaviour intensional characterization of the largest bisimulation intensional description intensional function definitions intensional languages intensional model intensional model of sequential algorithms intensional nature intensional property intensional semantics intensional strictness ordering intensional type theory intensional typed λ-calculus interacting interacting interacting automata interacting submodules interacting systems interaction interaction interaction axioms interaction for loosely coupled systems interaction grammars interaction machines interaction nets interaction primitives interaction product interaction systems interactions interaction-free interaction-free multivalued dependency sets interaction-free MVD set interactive interactive interactive case interactive identity machines interactive input/output interactive key distribution interactive perfect zero-knowledge proofs interactive proof interactive proof construction interactive proof system model interactive proof systems interactive proofs interactive proof-system interactive protocol interactive protocols interactive searching interactive system interactive systems interative interchange interchange condition interchange condition for linear context-free languages interchange condition linear context-free languages interchange lemma interchanges interchanges of adjacent objects intercluster intercomputer intercomputer communication interconnected interconnected networks of finite-state machines interconnecting interconnecting theories interconnection interconnection interconnection network interconnection network of processors interconnection network structure interconnection networks interconnection of subproblems interconnection scheme interconnection topology interconnections interconnections interconnections in OWCs interconnections of specifications interconvertibility interconvertibility relation interdefinability interdefinability interdefinability of parallel operations in PCF interdefinability of programming languages interdependent interdependent interdependent relations interdependent tasks interface interface interface specifications interface to MLP interfaces interfaces between interfaces between components interfaces between mathematical services interfaces of a module specification interference interference interference freedom check interfering rules interior interior interior ballistics interior of datatypes interior region interiors interleaved interleaved interleaved behaviour interleaved concurrency interleaved equivalences interleaved events interleaving interleaving interleaving behaviour interleaving behaviour of PT-nets interleaving closure interleaving computations interleaving equivalences interleaving observation equivalence interleaving of actions interleaving operator interleaving PDL interleaving semantics interleaving semantics in calculi for mobile processes interleaving sequences interleaving set temporal logic interleavings interleavings intermediate intermediate intermediate assertions intermediate between nets and domains intermediate class with linear alternation time intermediate code intermediate complexity intermediate growth intermediate hierarchy of elementary recursive sets intermediate in expressive power intermediate logics with logical constants, intermediate representations intermediate rewriting intermediate sentential forms intermediate stages intermediate step intermittent intermittent assertions intermittent assertions induction principles intermittent assertions method internal internal action construct internal actions internal choice internal computation internal contextual grammars internal language internal mobility internal node internal nondeterminism internal path length internal path length of a search tree internal state internal state of the process internal storage internal transition internally internally ω-complete partial order interpolating interpolating interpolating function interpolation interpolation interpolation methods interpolation of D0L-sequences interpolation polynomial interpolation polynomials interpolation theorems interpretability interpretability interpretability of arithmetic in temporal logic interpretability results for arithmetic theories interpretable interpretable typed λ-calculus interpretation interpretation interpretation function interpretation grammars interpretation method interpretation of interpretation of an assumption/guarantee specification interpretation of arithmetic in temporal logic interpretation of equality interpretation of grammar forms interpretation of infinite strings as real numbers interpretation of intuitionistic linear logic interpretation of negation interpretation of polymorphism interpretation of TLA interpretation of types interpretation of universal type abstraction interpretation rules modelling program execution interpretation theorem for DLP interpretation theorem from first order logic interpretation theorem of first-order logic interpretations interpretations interpretations into monoidal categories interpretations of interpretations of a interpretations of a calculus in another interpretations of a grammar interpretations of a program interpretations of a pushdown acceptor interpretations of E0L forms interpretations of equality interpretations of formulas interpretations of grammar forms interpretations of infinite interpretations of infinite strings interpretations of infinite trees interpretations of polymorphism interpretations of recursion interpretations of sorts as tuples interpretations of the λβ k-calculus interpretations of universal type abstraction interpreted interpreted elementary actions interpreted flowchart schemes interpreter interpreter interpreter program interpreter to define a language interpreters interpreting interpreting interpreting a interpreting a calculus in another interpreting a gene interpreting actions interpreting classical linear logic interpretive interpretive interpretive definition interpretive value interprocedural interprocedural interprocedural constant-propagation problem interprocedural dataflow analysis interprocess interprocess communication interprocess communication structures interrelated interrelated costs interrelationship interrelationship costs interruptions interruptions of service intersctive intersecting intersection intersection intersection classes intersection constraints intersection emptiness problem for picture languages intersection graph intersection graphs intersection graphs of disks intersection of intersection of Abelian permutation groups intersection of D0S languages intersection of half-spaces intersection of languages intersection of linearly recurrent sequences intersection of polyhedra intersection of regular languages intersection of SBTA-languages intersection of sets intersection operation intersection operation on languages intersection polyhedron intersection problem in free groups intersection problems intersection problems in free gorups intersection type intersection type assignment intersection type assignment system intersection type assignment systems intersection type discipline intersection type schemes intersection types intersection with regular intersection with regular languages intersection with regular sets intersections intersections intersections of intersections of circles intersections of lines with circles intersection-closed classes intersection-emptiness problems intertype intertype operations interunit interval interval interval analysis interval arithmetic interval functions interval graph interval graph recognition interval graphs interval logics interval order recognition interval orders interval partial orders interval queries interval queries on object interval queries on object histories interval query interval representations interval satisfiability problem intervals intervals inter-arrival times inter-dependence inter-processor communication inter-reducible problems intractability intractability intractability of intractability of NP-complete problems intractability of problems intractability of resolution intractability results for rewriting intractable intractable intractable complexity of expressions intractable computation intractable encoding scheme intractable set intractable sets intractibility intrinsic intrinsic difference between 1-tape and 2-tape Turing machines introduction of abstraction terms introduction of virus tests introduction rules intuitionism intuitionism intuitionistic intuitionistic intuitionistic content intuitionistic implication intuitionistic interpretation intuitionistic interpretation of deductive databases intuitionistic linear logic intuitionistic logic intuitionistic logic with equality intuitionistic model semantics intuitionistic natural deduction systems intuitionistic pointfree topology intuitionistic propositional logic intuitionistic type theory intuitionistically intuitionistically valid formula intuitive semantics intuitive semantics for ELECTRE invariance invariance invariance condition invariance of EP invariance requirement invariance theorem for while-statements invariance under finite stuttering invariant invariant invariant coding invariant decoders invariant factors of a matrix invariant factors of a matrix of rationals invariant factors of matrices invariant for invariant for context-free languages invariant level invariant measure invariant measures invariant of grammar transformations invariant problem invariant property of the structure of finite automata invariant scalar products invariant structures invariant subspaces invariant techniques invariant theory invariant translation invariant under invariant under an algorithm invariants invariants invariants for context free languages invariants for context-free languages invariants of invariants of complexity invariants of Petri nets invariants of programs invariant-method inventories inventory inverse inverse inverse convolution problem inverse generators inverse homomorphic equality inverse homomorphic equality operations inverse homomorphism inverse homomorphism operation inverse homomorphisms of languages inverse image of a submonoid inverse in a semigroup inverse Laplace transform inverse limit inverse limit construction inverse limit construction of Scott inverse limits inverse limits of inverse limits of algebras inverse limits of digital spaces inverse monoids inverse monoids of dot-depth two inverse morphism inverse morphisms inverse morphisms on context free languages inverse morphisms on context-free languages inverse non-erasing morphisms inverse of a Wedderburn transform inverse projection operations inverse quadrangle inequality inverse semigroups inverse shuffle inverse to a hierarchic derivor inverse transformation inverse transformation of homomorphisms inverse uniform morphisms inverses inverses inversion inversion inversion of ill-conditioned matrices inversion of order-sorted derivors inversions inversions inversion-free inverted inverted inverted file inverted lists invertibility invertibility invertible invertible invertible binary word invertible one-variable partial recursive functions invertible operations invertible reductions invertible terms invertible terms in the λ-calculus invertible terms with normal form invertibly invertibly paddable inverting inverting a nonsingular matrix invisible invisible invisible actions invisible enabledness invisible lines invocation invocation of external functions invocations invocations involution involution in-degree in-forests IO IOCC IOCC IO- and OI-hierarchies IO- and OI-macro languages ireducible ireducible polynomial irrational irrational real numbers irrational rotations irrational speeds irreducibility irreducibility predicate irreducible irreducible irreducible algebras irreducible components irreducible components of algebraic varieties irreducible deterministic automaton irreducible elements derivable irreducible form irreducible information systems irreducible polynomial irreducible second order DE's irreducible semigroup irreducible sofic shifts irreducible synchronization irreducible synchronization structures irreducible tree irreducible varieties irreflexive irreflexive relation defined by a set covering irregular irregular irregular parallel applications irregular triangular meshes irreversible irreversible irreversible cellular automata irreversible CM(k) ISA ISA hierarchies ISA hierarchies in knowledge representation diagrams ISO ISO specification language LOTOS isoceles isolated isolated isolated cut point isolated roots isolated solutions isolation isolation lemma isolation lemma for m-interpretations isometric isometric isometric array languages isometric embedding isometrics isometrics isomorphic isomorphic isomorphic canonical event structures isomorphic grammars isomorphic PD0L sequences isomorphic representations isomorphic subgroups isomorphic subgroups problem isomorphic to SAT isomorphically isomorphically embedded isomorphism isomorphism isomorphism conjecture isomorphism decision problem isomorphism of isomorphism of Banyan networks isomorphism of models isomorphism of natural complete sets isomorphism of NP and PTAPE complete sets isomorphism of PD0L forms isomorphism of rewriting systems isomorphism of synchronization trees isomorphism of syntactic monoids isomorphism problems isomorphism type isomorphism types isomorphisms isoperimetric isoperimetric number problem isotone isotone maps isotonic isotonic mappings isotopism isotropy isotropy group isotropy groups ISO-Pascal issues IST IST IST method Istrail ISWIM ISWIM ISWIN ITA ITA ITA implementation of real-time infinite memory ITA's item item grammars item notation iterate iterated iterated ε-free finite substitutions iterated application of substitutions iterated exponential time iterated function system iterated function systems iterated function systems with probabilities iterated inductions iterated inductive definitions iterated look-ahead iterated morphisms iterated parallel substitution iterated pattern languages iterated piecewise-linear maps iterated piecewise-monotone maps iterated process iterated pushdown iterated rewriting iterated shuffle iterated strength reduction iterated transactions iterates iterates iterates of morphisms iterating iterating iterating iterated substitution iterating maps iterating morphisms iteration iteration iteration conditions for semigroups iteration congruence iteration for polynomial equations iteration lemma iteration modes iteration of iteration of control iteration of mappings iteration of T-transductions iteration operation iteration program operator iteration property iteration quantifiers iteration theorem for LL-languages iteration theorems iteration theorems for iteration theorems for deterministic languages iteration theorems for families of strict deterministic languages iteration theorems for languages iteration theorems for LL(k) languages iteration theories iteration theory iteration using while statements iterations iterations iterations for polynomial equations iterations for solving nonlinear equations iterations using linear information iterative iterative iterative algebra iterative algebraic iterative algebraic theories iterative algebras iterative algorithm iterative application iterative arrays iterative belief revision iterative calculus iterative computation of Ackermann's function iterative constructs iterative control iterative data types iterative definitions iterative equation iterative equations iterative factor iterative factor algebras iterative forms iterative functions iterative interpretation iterative pairs iterative phenomena iterative procedure calls iterative procedures iterative productibility iterative programming language iterative programs iterative solution of distributed control problems iterative techniques iterative theories iterative tree iterative tree automata iterative tree automaton iteratively iteratively iteratively defined functions iteratively greatest fixed point Ito Ito IVG IVG i-acceptance i-adaptive schemes i-adaptive search I-categories I-monoids I-product I-relations I-strict continuous extensions I-strict continuous extensions of operations Jacobs Jacobs Jacopini JAG JAG JAG model Janicki Janicki Janssens Janssens Janssens and Rozenberg Jantzen Jantzen Jantzen monoid JD JD Jean Jenks Jenks and Sutor Jerrum Jerrum Jerrum and Sinclair algorithm Jerrum et al. jeu jeu de taguin jeu de taquin Jewett Jiang Jiang Jiang and Li Jiang and Zhang Jiang et al. jigsaw jigsaw jigsaw operator jigsaw program composition operator job job class job class change job class membership job classes job lengths job sequencing job values jobs jobs jobs with weights and precedence job-assignment problem Johansen Johansen Johansen and Ochsenschla¨ger Johnson Johnson Johnson et al. Johnston Johnston's Johnston's model of DCP Johnstone Johnstone join join join dependency join conditional term rewrite systems join continuity join continuity in join dependencies join dependencies join dependencies in databases join dependency join dependency inferences join expressions join operation join sizes Joinnault Joinnault's Joinnault's undecidability results joins joins joins in relational databases joint joint joint Δ-continuity joint continuity joint distribution join-irreducibility join-irreducible elements in a bilattice Jones Jones Jordan Jordan theorem Jörgensen Joseph Joseph and Young Joshi Joshi et al. Jouannaud Jouannaud and Jouannaud and Kounalis Jouannaud-Kirchner procedure Jouannoud Joyal Joyal Joyal Nielsen and Winskel Joyal, Nielsen and Winskel judgement judgements judgements Juedes Juedes and Lutz jump jump operator jumping jumping jumping automaton on graphs jumping bisimulation jumps jumps Jung jungle jungle representation Jung-Tiuryn characterization of λ-definability justify Jutla juxtaposition juxtaposition J-trivial semigroups K combinator k successor monadic arithmetic (k, i)-bounded (k, i)-bounded grammar family of a grammar form (k, i)-bounded interpretation (k, l)-completely creative sets (k, l)-creative sets K45 modal logic K5 modal logic Ko¨nig Ko¨nig's lemma Ku¨nen's semantics K45 modal logic K5 modal logic Kaas Kaci Kadell Kadell Kahn Kahn Kahn and Plotkin concrete data structures Kahn and Plotkin theory of concrete data structures Kahn networks Kahn principle Kahn's Kahn's Kahn's concrete domains Kahn's data flow message passing networks Kahn's data flow message passing networks Kahn's extensional semantics Kahn's extensional semantics of dataflow Kahn's fixed-point principle Kahn-Plotkin concrete data structures Kailath Kailath et al. Kalm Kalma´r Kalma´r's class E of elementary functions Kaltofen Kamae Kamae Kaminski Kaminski Kanellakis Kanellakis et al. Kannan Kannan Kannan's Kannan's algorithm Kannan's algorithm for Korkine-Zolotareff reduction Kanovich Kanovich κ-denotational semantics Kapur Kapur et al. Karhum Karhuma¨ki Karmarkar Karmarkar et al. Karp Karp Karp and Karp and Lipton Karp and Lipton's round-robin tournament method Karp and Miller Karp et al. Karpinski Karp-Levin Karp-Levin complete Karp-Miller Karp-Miller decision procedure Karp-Miller vector addition system Karp-Miller-Rosenberg algorithm Karzanov Karzanov Kasa Kasaa¨ Kasami Kasami et al. Kasteleyn Katrin Katrina´k Kayles Kayles KBL KBL KBL program KBL's KBL's operational semantics KD KD modal logic KD4 modal logic2063 KD45 modal logic KD5 modal logic KDA KDA KDA class of representable dynamic algebras KDA representable dynamic algebras Kedem Kedem-Landau-Palem algorithms Keller Keller Keller data flow machine Kemp Kemp Kennaway Kennaway Kennaway and Raoult Kennedy Kennedy and Kennedy and Cocke Kennedy and Warren kernel kernel kernel constructibility kernel dynamic Prolog kernel Fun variant of F≤ kernel language kernel of kernel of a graph kernel of graph problems kernel of the language ELECTRE kernel Prolog kernel strategy kernels Ketonen Ketonen and Ketonen and Solovay Ketonen and Weyhrauch key key key predistribution scheme key theorems keys keys key-to-key comparisons KF KF modal logic Kfouri Kfouri Khachiyan Khachiyan Khachiyan's Khachiyan's algorithm Khachiyan's algorithm for linear programming Khovanskii Khrapchenko Khrapchenko's Khrapchenko's theorem Kierstead Kierstead Kiesswetter Kiesswetter curve Kifer Kifer and Bonner Kikuchi Kikuchi and Fujino kilter Kinber kinded kinds of nondeterminism Kirchner Kirkpatrick Kirkpatrick Kirschenhofer Kirschenhofer and Prodinger Klarlund Klarlund Klarlund's progress measure technique Kleen Kleen + (*) closure Kleene Kleene Kleene ω-chain Kleene + ☆ closure Kleene + * closure Kleene algebras Kleene algebras of relations Kleene arithmetical hierarchy Kleene chain Kleene chain complete Kleene chain completeness Kleene characterization Kleene characterization of recognizable subsets Kleene closure Kleene iteration Kleene recursive realizability Kleene semigroups Kleene star Kleene star operation Kleene's Kleene's Kleene's regular Kleene's regular expression Kleene's regular operators Kleene's star Kleene's star operation Kleene's Theorem Kleene-Kreisel countable functionals Kleene-Ochma theorem Kleene-star iteration Kleene-type characterization Kleene-type characterization of the recognizable languages Kleijn Kleijn and Rozenberg Kleijn-Rozenberg k-adjacent languages Klein Klein and Wood Klein-Reif algorithm Kleisli Kleisli categories Kleisli categories in semigroup theory Kleisli category Kleisli category of algebras Kloosterman Kloosterman sums Klop Klop Klop's Klop's conjecture Klop's counterexample Klop's counterexample to the Church-Rosser property Klug Klug's Klug's first order language with aggregates KMP KMP failure function KMR knapsack knapsack packing problem knapsack problems Knast Knaster Knaster-Tarski fixed point theorem kneading knight knight tours on a chess board knowledge knowledge about belief knowledge base knowledge base language knowledge bases knowledge complexity knowledge discovery knowledge discovery mechanisms knowledge ordering knowledge part of the bilattice knowledge representation knowledge representation diagrams knowledge representation system knowledge representation system for nondeterministic information knowledge representation systems knowledge rules knowledge-base systems Knuth Knuth Knuth and Bendix Knuth and Bendix completion procedure Knuth and Floyd Knuth's Knuth's Knuth's algorithm Knuth's informal description of bitonic sort Knuth's model Knuth, Morris and Pratt Knuthian Knuthian semantics Knuth-Bendix Knuth-Bendix algorithm Knuth-Bendix completion Knuth-Bendix completion algorithm Knuth-Bendix completion for concurrent processes Knuth-Bendix completion procedure Knuth-Bendix confluence criterion Knuth-Bendix ordering Knuth-Morris-Pratt Knuth-Morris-Pratt algorithm Knuth-Morris-Pratt character comparison order Knuth-Morris-Pratt string-matching Knuth-Morris-Pratt string-matching algorithm Knuth-Morris-Pratt string-matching procedure Ko Ko Ko and Scho¨ning Kobayashi Kobayashi Koch Kohn Kohn and Nerode Koiran Koiran Koiran setting Koiran setting independent Koiran's Koiran's weak model Kolam Kolmogorov Kolmogorov Kolmogorov characterizations of complexity classes Kolmogorov complexity Kolmogorov complexity of an isomorphism type Kolmogorov expressive power Kolmogorov numberings Kolmogorov simple Kolmogorov's Kolmogorov's complexity measure Komori Komori König König's Koomen Koomen's Koomen's fair abstraction rule Korenjak Korenjak and Hopcroft Korenjak and Hopcroft branching algorithm Korkine Korkine-Zolotareff reduction Kósa Kosaraju Kosaraju Kosaraju and Delcher Kosaraju's Kosaraju's # schemes Kosaraju's BJn schemes Kosaraju's BJn-schemes Koskinen Koskinen and Salomaa Koubek Koubek Kounalis Kounalis and Jouannoud Kowalevskaya Kowalevskaya and Gambier method Kowalski Kowalski Kowalski's Kowalski's semantics of logic programs Kozen Kozen Kozen and Park KPU KPU-absolute KR Kraft Kraft sum Krause Krause and Krause and Pudla´k Krause and Waack Kreisel Kreisel Kreitz Kreitz Kriegspiel Kriegspiel kriegspiel Kripke Kripke Kripke frames Kripke model Kripke models Kripke structure Kripke structures Kripke-like relations Kripke-style structures Krivine Krivine Krivine's Krivine's machine Krohn Krohn-Rhodes Krohn-Rhodes decomposition Krohn-Rhodes decomposition theorem Krohn-Rhodes irreducibility Krom Krom clauses Krom formulas Kruskal Kruskal and Snir Kruskal's Kruskal's tree theorem KR-systems KT KT modal logic KT4 modal logic Kucera Kucera's Kucera's priority free proof Kuich Kuich and Urbanek KUM KUM Kundu Kundu Kunen Kunen Kunen's Kunen's completion semantics Kunen's three-valued completeness theorem Kunen's two valued completeness theorem Kung Kuratowski Kuratowski graphs Kurka Kurka Kurtz Kurtz Kushnirenko Kuzmin Kuzmin [k]-machine k-adjacent k-adjacent derivations k-adjacent languages k-arbiters k-ary k-ary balanced trees k-ary hypercube k-ary relations k-ary tree k-ary tree representation scheme k-ary trees K-automata k-automata k-automatic sequence k-cheatable oracle k-chordal graph k-completely creative sets k-connected hypergraphs k-connected source graph k-context-free languages k-counter machine k-creative k-creative set k-creative sets K-d tree k-deletability k-derivation forests k-derivations k-dimension k-dimensional components k-dominating set problem k-flat PCP k-flatwords k-hypergraphs k-label spaces k-limited ET0L systems k-machine k-mismatches string searching k-mutual exclusion K-oracle k-parallel rewriting k-power free strings k-provability problem k-quasi k-quasi formulas k-quasi Horn formulas k-queue machines K-rational expressions k-recognizable k-recognizable set k-regular k-regular graph k-regular sequences k-resolution k-resolution refutation k-retreat-bounded k-retreat-bounded nonvertical-stripe picture language k-retreat-bounded picture language k-reversal-bounded k-reversal-bounded picture language k-reversal-bounded regular picture languages k-reversible languages k-separated k-separated apex eNCE grammar k-separated eNCE graph languages k-separated grammars k-separated graph grammar k-server problem k-sparse multivariate polynomials k-split trees k-stable k-stable language k-stable word k-stack-counter k-structure generalization k-structures k-tape alternating Turing machine k-term subclass k-th level in the polynomial hierarchy k-th power-free k-th power-free homomorphisms k-th power-free string k-th power-free strings k-th power-free words k-th power-freeness k-trees k-valued distance automaton L = L2 L = NL L = NL question L =? NL question L code L codes L codes of bounded delay L form defining a family of languages L forms L languages L scheme L system L systems L systems problem book L(BSTA), class of languages accepted by binary systolic tree automata Le´vy Le´vy term model for the λ-calculus Le´vy's redex-families Lo¨wenheim L1 norms L1 recognizable L1 recognizable L<ω1ω Lc Lsb modal logic LA LAA LAA LAA's LAAs label expressions label expressions in CSS labeled labeled labeled 2-structure labeled acyclic directed graphs labeled directed graph labeled disjoint unions labeled hypergraphs labeled partial orders labeled records labeled super-nets labeled transition labeled transition system labeled transition systems labeled tree families labeled trees labeling labeling labelings labelings with minimal labelings with minimal average distance labelings with minimal diameter labelled labelled labelled λ-calculus labelled 1-safe nets labelled arcs labelled combinatorial objects labelled combinatorial objects structures labelled combinatorial structures labelled context-free graphs labelled dag labelled data types labelled domains labelled event structures labelled events labelled graph labelled graphs labelled P/T nets labelled partial orders labelled partially ordered sets labelled poset labelled rules labelled subtrees labelled transition labelled transition graph labelled transition relation labelled transition system labelled transition system semantics labelled transition systems labelled trees labelling labelling labelling function labelling plane graphs labelling schemes labels labels of labels of events labels of nodes labels of synchronization events label-selective λ-calculus laboratory laboratory tools Lachlan Lachlan Lacombe Lacombe ladeau Ladner Ladner Ladner Lynch and Selman Ladner's theorem Ladner, Lynch and Selman Lafont Lafont LAG LAG Lagarrigue Lagois Lagois connections Lagrange Lagrange inversion formula Lagrangian Lagrangian interpolation polynomial LAGs Lallement Lallement LALR LALR(1) context Lamarche Lamarche lambda abstraction algebra lambda calculi lambda calculi with restricted expansion rules lambda calculus lambda calculus model Lambda calculus with surjective pairing lambda models lambda term rewriting lambda terms definable as combinators λ λ abstraction algebras λ calculus λ c-calculus λ definability λ Prolog λ terms λβ k-calculus λβη-calculus λβ-normal form λβ-reduction λ&-calculus λ, β, η-calculus λν-calculus λProlog λProlog λ-β-η-calculus λ-β-calculus λ-abstract λ-abstraction λ-calculus λ-calculus for dynamic binding λ-calculus models λ-calculus modulo a theory λ-calculus standard operational classification criteria λ-calculus with constants λ-confluent λ-definable word function λ-expressions λ-free λ-free context-free language λ-free context-sensitive λ-K-terms λ-language λ-linearly bounded deque automata λ-model λ-models λ-notation λ-operator λ-programs λ-programs on term algebras λ-reduction λ-term λ-terms λ-trees Lambda-calculus Lambda-calculus with couples Lambda-calculus with couples and projection rules Lambda-calculus with explicit couples Lambda-Upsilon-Omega system Lambek Lambek Lambek and Scott Lambek calculus Lambek categorial grammars Lamnabhi Lamnabhi Lamnabhi-Lagarrigue Lamping Lamping Lamping's optimal graph reduction Lamport Lamport Lamport's partial-ordering models Landau Lando Landweber Landweber Landweber accepting conditions langages Langlois Langlois Langmaack Langmaack and Olderog language language language acceptor language CCS language classes language CLEAR language complexity language construct language CSP language definitions language design language equation language equations language equivalence language equivalence problem language families language for language for conjunctive and disjunctive sets language for defining nondeterministic information # (language for directed design) language for expressing recursive systems of flowgraph equations language forms language function language generated by a prefix code language generating power language generators language hierarchies language hierarchy language inclusion problem language layers language learnability language learning language learning by EFS language learning from text language matching language NDPCF language not recognizable in real time language of language of λ expressions language of a 0L system language of a [k]-machine language of all factors of all 2-paperfolding sequences language of ALNA language of an information system language of communicating sequential processes language of CSS language of domain theory language of factors of Sturmian sequences language of finitely typed functional programs language of function-free definite clauses language of generalized regular expressions language of graph rewriting language of iterated inductive definitions language of minimal strings language of net theory language of palutators language of primitive words language of regular systems language of thresholds language operations language operator Init language operators language PL language processing language processing problems language recognition language recognition capabilities language recognizers language relations language semantics language supporting recursion language S-TL language S-TL(ω) language terms language theoretical properties of Petri nets language theory language theory of words of infinite length language translation language type language varieties language with language with assignments language with blocks language with local variables language with three levels language without language without empty word language without recursion languages languages languages on one- and two-letter alphabets languages acceptable in exponential time languages accepted by languages accepted by alternating automata languages accepted by binary systolic tree automata languages accepted by blind multicounter machines languages accepted by deterministic languages accepted by deterministic linear bounded automata languages accepted by deterministic sensing simple one-way two-head finite automata languages accepted by machines languages accepted by nondeterministic one-counter automata languages accepted by one-way languages accepted by one-way nondeterministic simple multihead automata languages accepted by one-way preset TM's languages accepted by polynomial space bounded TM's languages accepted by pushdown-like acceptors languages accepted by SBTA's languages accepted by systolic automata languages accepted in polynomial time languages associated to languages associated to Petri nets languages associated to VAS's languages associated with super-nets languages definable languages definable by shuffle expressions languages definable within three visits languages defined by languages defined by literal shuffle languages defined by pushdown machines languages depth in EDT0L languages languages equivalence problem languages for distributed programming languages for distributed programming based on communication languages for expressing recursive systems of flowgraph equations languages generated by languages generated by deterministic Lindenmayer systems languages generated by Petri nets languages generated by two-level gramars languages intermediate between sentential and predicate calculi languages of languages of behaviours languages of colonies languages of dot-depth two languages of finite traces languages of multidimensional trees languages of net theory languages of pattern grammars languages of Petri nets languages of single letter alphabets languages of two-sided infinite words languages over languages over disjoint alphabets languages over single letter alphabets languages recognized by languages recognized by a monoid languages recognized by an injective automaton languages recognized by deterministic reversal-bounded multipushdown machines languages recognized by finite automata languages recognized by two-way deterministic FAM's languages simulations of languages in another languages specified by relative acceptance languages that are supports of rational series languages with a fair distribution of letters languages with approximations languages with block structure languages with counter languages with explicit recursion operators languages with fair distribution of letters languages with homomorphic replacements languages with homorphic replacements languages with infinite words languages with inverse syntactic momoid languages with iteration languages with iteration or recursion languages with process creation languages with recursion languages with the finite power property languages with the negative prefix property languages with uniform concurrency language-dependent primitives language-layers language-theoretic language-theoretic closure properties language-theoretic problems language-theoretic properties language-theoretic terms language-theoretical representations Lankford Lankford Laplace Laplace transform large application benchmarks large assemblies large bodies of text large categories large categories in semigroup theory large circuit large class large class of action refinements large class of preemptive schedules large classes large combinational complexity large deviations large factors large families large families of large families of languages large finite sets large ground classes in an object-oriented language large interconnection networks large monotone complexity large Petri nets large primes large scale programming large size large software system specifications large superlinear lower bounds large systems large transformation largest largest largest bisimulation largest Cartesian closed category of domains largest category of domains largest class of automata with decidable equivalence problem largest common initial subtree largest congruence largest eigenvalue largest integer in a VASS largest monotone non-decreasing function largest preparator functions largest prime factor largest right factor largest sum segment problem largest tree in a random graph large-scale large-scale programming large-scale verification lark lark combinator Larsen Larsen Larsen-Thomsen modal transitive systems Las Vegas Las Vegas Las Vegas polynomial time last in first out last-birth problem last-in-first-out with preemption late late binding late bisimulation equivalence late semantics latency latency LATIME LATIME LATIME complexity class LATIME linear alternation time Latin Latin square isotopism problem lattice lattice lattice basis reduction algorithms lattice embeddings lattice graphs lattice of lattice of all subsets lattice of codes lattice of complexity lattice of complexity classes lattice of complexity cores lattice of families of languages lattice of hard cores lattice of ideals of a partial order lattice of monotonic predicate transformers lattice of NP sets lattice of programs lattice of r.e. sets lattice of r.e. supersets lattice of sets lattice of unmarked nets lattice operations lattice Pω lattice properties of finite structures lattice reduction algorithm lattice reduction algorithm of Gauss lattice representation lattice structure lattice structures lattice theory lattices lattices lattices of global states lattice-Bessel functions lattice-ordered semigroup lattice-point lattice-theoretic representation theorems Laubie Lautenbach Lautenbach law law of the excluded miracle Lawler Lawler laws laws laws of cautious laws of cautious cut laws of cautious monotony laws of Occam programming laws of physics laws of wPS(-) laws of wpS(-) Lawson Lawvere Lawvere Lawvere algebraic theories Lawvere hyperdoctrine lax lax coexponents layer layer size layered layered graphs of width two layering layering layering of a program layers layers layers of pixels layout layout layout area of Boolean circuits layout parameters of a graph layout parameters of graphs layouts layouts lazy lazy lazy λ calculus lazy abstract machine lazy adversary lazy computation lazy data flow lazy data flow deadlock lazy data flow languages lazy evaluation lazy evaluation scheme lazy functional language lazy functional languages lazy narrowing lazy patterns lazy semantics LA-grammars LC LC LC grammars LC tests LC(0) and languages LC(0) grammars LC(0) languages LC(k) grammars LC*, category of complete lattices and chain-*continuous maps LCF LCF LCF axioms LCF theorem LCFS LCFS-PR queuing discipline LCNS LCNS LCS LCS LCS algorithm LCS algorithm problem LDM LDM ≤pm-complete languages leader election leader election problem leader election protocol leader finding leader finding problem leader-election problem leads-to proposition leads-to semantics leaf leaf-size bounded leaf-size bounded computations leaf-size bounded two-dimensional ATM's leaf-size complexity measure leaf-size hierarchy leaf-size hierarchy of two-dimensional ATM's leaf-tree data structure learnability learnability learnability definition learnability from learnability from noisy informant learnability from text learnability of learnability of concepts learnability of decision procedures learnability of target classes learnability results learnable learnable learnable concept class learnable families learnable from positive examples learnable with respect to a distribution learned knowledge learner learner learners learning learning learning algorithm learning algorithm for k-reversible languages learning algorithms learning approximately regular languages learning as a homotopy learning capability learning context-free grammars learning counting functions learning deterministic even linear languages learning disjunctions of counting functions learning domain learning domains learning elementary formal systems learning environments learning finite sequences of recursive functions learning from learning from examples learning from imperfect environment learning in the limit learning machine learning machines learning method learning model learning models learning nested differences learning new predicates learning noisy data learning of learning of indexed families learning of logic programs learning orthogonal F-Horn formulas learning pattern languages learning power learning problem learning procedure learning procedures learning process learning programs learning restricted versions of logic programs learning semilinear sets learning strings learning theory learning uniformly recursive families learning unions of tree patterns learning without additional constraints least alphabets least and greatest fixed points of monotone operators least comon multiple least congruence induced by an equational definition least continuous function least element least element of a partially ordered set least fixed point least fixed point constructions least fixed point operator least fixed point operators least fixed point property least fixed point semantics least fixed points least fixed points of continuous predicate transformers least fixedpoint least fixedpoint operation least fixedpoint operator least fixedpoint property for ω-continuous functions least fixedpoint semantics least fixedpoint solutions least fixedpoints least fixed-point characterization least fixed-point semantics least fixed-point solutions least fixpoint least fixpoint operator least fixpoints least Herbrand model least Herbrand model semantics least lexicographic rotation least model semantics least positive zero least pre-fixed point solutions least solutions least sub-CCC least upper bound least upper bounds of chains least-fixed-point operator Lebesgue Lebesgue Lebesgue integral Lebesgue measurability Lebesgue measure Lebesgue measure one Lech Lee Lee and Rozenberg left adjoint left adjoint of a forgetful functor left adjoints left adjoints for the inclusion functor left adjoints to forgetful functors left associative grammar left associative grammars left center of a language left completions in a language left concatenation left concatenation by languages left cut representation left cut representation of real numbers left cuts left cylindrification operator left depth of a left directed graph left distributive structures left factor left factors of left factors of Dyck words left factors of Motzkin words left ideal left ideals left inverses left quotient left recursion left right left sequential function left simple polynomials left simple polynomials over free process algebras left simple semigroups left subsequential left subsequential transducer left subsequential transductions left terminating behaviour left termination left to right orientation of strings left very-simple grammar leftmost leftmost derivation left-associative grammar left-cancellative left-conjugacy problem left-continuous left-corner grammars left-cyclic rules left-hand sides left-hand sides of rewrite rules left-invertible elements left-linear left-linear recursions left-linear rewrite system left-linear term rewriting left-linear term rewriting system left-linear term rewriting systems left-linear term-rewriting systems left-linear TRF rewrite system left-moves left-palindrome closure left-recursive grammars left-to-right left-to-right computation left-to-right language translation left-to-right rewriting left-to-right SIPS left-to-right sips left-wrapping HG's legal legal legal arithmetic operations legal move legal three-valued logic programs legality legality legality concepts Lehman Lehmann Lehmann and Rabin Lehmann and Smyth Lehman-Lenormand language Lehr Lehr Lei Leighton Leighton's Leighton's mesh of trees network model Leiserson Leiserson and Saxe retiming lemma Leivant Leivant Leivant's Leivant's characterization of Floyd-Hoare logic lemma Lempel Lempel Lempel et al. Lempel Even and Cederbaum Lempel, Even and Cederbaum Lempel-Even-Cederbaum planarity-testing algorithm Lempel-Ziv parsing scheme lenghths lenghths of rewriting chains length length length increasing reductions length of length of addition chains length of derivations length of searches length of shortest resolution proof length of terms length problem length sequence length slices length strings lengths lengths length-bounded length-bounded elementary formal system length-bounded elementary formal systems length-bounded rational equivalence relations length-increasing polynomial-time reductions length-preserving length-preserving homomorphism length-preserving homomorphisms length-preserving semi-Thue systems length-reducing length-reducing rewriting system length-reducing systems length-set Lenormand lens lens Lensta Lenstra Lenstra Lenstra Lensta Jr and Lova´sz Lenstra Lenstra and Lova´sz algorithm Lenstra Lenstra and Lova´sz reduction algorithm Lenstra, Lenstra Jr and Lova´sz Lerman Lerman letrec letrec feature letter to ε homomorphism letters letter-to-ε homomorphism letter-to-letter homomorphism letter-to-letter homomorphisms let-in constructor level n program schemes level of level of an external node in a search tree level of atomicity level of complementation level of functional programs level of importance level of local consistency level of perturbation level of service level of significance in a universal test of randomness level of the fine structure levelable levelable set leveled leveled optical network levels levels of description levels of equivalence levels of implementation level-concept Levenshtein Levenshtein distance Levi Levi and Gabbrielli Levi et al., Tamaki, Sato Levin Levin Levin and Schnorr Lewis lexicographic lexicographic lexicographic generation of ordered trees lexicographic generation of trees lexicographic minimum lexicographic order lexicographic ordering lexicographic path orderings lexicographic sorting lexicographic status lexicographical lexicographical lexicographical first DTML lexicographical ordering lexicographically lexicographically first lexicographically first four colouring lexicographically first maximal lexicographically first maximal subgraph problem lexicons lexicons lex-first maximal matching LF LFM LFM LFM induced path problem LFM rooted tree problem LF-DTML LF-DTML problem lgyi Liapunov Liapunov function Libkin Libkin and Wong libraries library library of module specifications Lie algebra Lie algebras Lie elements lie patterns in search procedures lies in search games LIFO LIFO LIFO/PR Lifschitz Lifschitz, Gelfond-~ stable model semantics lifting lifting lemma lifting lemma in logic programming liftings lightwave Lilin Lilin liminf liminf convergence limit limit limit closure limit closure of paths limit cycles limit distributions limit in a metric space limit language limit language equivalence problem limit language families limit laws in combinatorics limit of limit of approximations limit of finite approximations limit of sequences of languages limit points limit probability distribution limit sets limit theorem limitations limitations of categorial axiomatizations limitations of MEIJE limitations on limitations on data compression schemes limitations on taking quotients in the category of algebraic lattices limited limited limited access to a data base limited asynchrony limited communication limited computing power limited counting ability limited ET0L systems limited form of graph rewriting limited forms limited in distance limited memory limited Muller automata limited recursion limited register machines limited regular languages limited sorts limited sorts of programming languages limitedness limitedness theorem limitedness theorem on finite automata limiting limiting limiting behavior limiting behavior of the switching curve limiting behaviour limiting behaviour of event instants limiting complete limiting completeness limiting completeness in equational languages limiting distributions limiting Gaussian Markovian processes limiting processes limiting processes for languages limiting program semantics limiting semantics limits limits limits as error tends to zero limits for Cauchy towers of spaces limits in enriched categories limits of limits of Cauchy sequences limits of languages limits of precision limits of sequences limit-taking transformation Lind Lind Linda Linda coordination primitives Lindenbaum Lindenbaum-Tarski algebras Lindenmayer Lindenmayer Lindenmayer and Rozenberg Lindenmayer EPT0L languages Lindenmayer systems Lindenmayerian Lindenmayerian algebraic Lindenmayerian algebraic power series Lindenmayerian algebraic sequences Lindenstrauss Lindenstrauss and Dershowitz line graph on four nodes lineages lineal lineal spanning tree linear linear linear λ-terms linear ω-languages linear 2-structure linear 2-structures linear abstract machine linear advice linear algebra linear algebra programs linear algebra techniques linear algebraic linear algebraic calculation linear algebraic characterization linear algorithm for random generation of polynominoes linear algorithms linear alternation time linear and linear and max constraint systems linear and min constraint systems linear approximation linear arithmetic decision procedure linear arithmetical terms linear arrangement problem for trees linear array linear array architecture linear array computations linear array of linear array of finite-state machines linear array of identical finite-state machines linear automata linear average cost linear block linear bounded automata linear branching programs linear cellular automata linear chain inference from a single walk linear codes linear combinational complexity linear combinations linear comparisons linear complementarity for $P$-matrices linear completion linear complexity linear constant restrictions linear constraint databases linear constraints linear construction linear context free grammars linear context free languages linear context-free linear context-free grammars linear context-free languages linear cost linear decision tree linear decision tree model linear decision trees linear difference linear difference equations linear difference operators linear differential linear differential and difference operators linear differential equation linear differential equations linear differential operators linear differential systems linear Diophantine linear Diophantine equations linear Diophantine systems of equations and inequations linear dynamic Kahn networks linear embeddings linear equations linear equations over polynomials linear exponential time linear extensions linear extensions of an ordered set linear first-order predicate logic linear fitness scaling linear form linear form of logarithms linear forms linear functional language linear functions linear generalized semi-monadic rewrite system linear goals linear grammars linear graph theory linear graphs linear group linear hash functions linear homomorphism tree transformations linear hybrid systems linear indexed grammars linear indexed languages linear inequalities linear information linear isomorphism linear labeling process linear language linear languages linear left simple polynomials linear lists linear logic linear lower bound linear maps linear matrix algebra linear monadic linear monadic recursion schemes linear movement linear natural deduction linear NCE graph language linear negation linear network linear NLC graph languages linear nondeleting tree transformations linear nondeterministic dynamic networks linear number of gates linear numbers linear numeration systems linear objective function linear orderings linear orders linear ordinary differential linear ordinary differential equation linear ordinary differential equations linear paramodulation linear picture languages linear polymorphism linear polynomials linear processes linear productions linear programming linear programming problems linear queries linear randomized time linear recurrence linear recurrence sequence linear recurrences linear relations linear search algorithm linear search algorithms linear sentences linear sequences of communications linear sets linear size linear size test sets linear solution to coarsest partition problems linear space linear space bounded Turing machine linear space computable linear spatial transformation linear speedup linear speedup theorem linear speed-up linear storage linear storage device linear string-matching algorithm linear structure in a process category linear structures linear subword complexity linear sub-spaces linear systems linear systems of linear systems of context-free grammars linear systems of equations linear s-grammars linear tapes linear temporal logic linear tense logics linear terms linear test complexity linear time linear time μ-calculus linear time algorithm linear time and space linear time behavior of 2DPDA's linear time complexity linear time computational power linear time decidability linear time epsilon-approximation algorithm linear time Las Vegas algorithms linear time models linear time parsers linear time proofs linear time semantics linear time serial algorithm linear time solvable word problem linear time sorting linear time union-find strategies linear time with branching gaps linear time-branching time spectrum linear tree linear tree transformations linear trees linear unification algorithm linearity linearity linearity of on-line functions linearity test linearizations linearizations linearizations of partial orderings linearly linearly bounded D0L languages linearly recurrent sequences linear-bounded sigmoid linear-constant propagation linear-erasing linear-erasing ACFG's linear-history semantics linear-space linear-space LCS linear-space LCS algorithm linear-space LCS computations linear-time linear-time algorithm linear-time algorithms linear-time cellular automata linear-time composition function linear-time computations linear-time constant-space linear-time constant-space algorithm linear-time constant-space string-matching algorithm linear-time fragment linear-time heuristic linear-time implementation linear-time ITA linear-time operators linear-time recognition algorithm linear-time string-matching linear-time string-matching algorithm linear-time temporal logic linear-time transformations linear-time-solvable lines lines in space line-point incidence graph linguistics linguistics link capacity linkage linkage of a graph linked memory structure links Linna Linnik Linnik's Linnik's theorem on prime distribution Liouvillan Liouville Liouville's theory of integration Liouville-Ritt-Risch theory Liouville-Ritt-Risch theory of closed-form solvability Liouvillian Liouvillian Liouvillian first integral Liouvillian solution Liouvillian solutions Lipschitz Lipschitz Lipschitz condition Lipschitz ODE's Lipschitz ODEs Lipschitz-continuous derivative Lipski Lipson Lipton Lipton's LISP Lisp Lisp LISP interpreter Lisp machine Lisp-based compiler Lisp-like Lisp-like functional programming Lisp-like program list in the sense of LISP list of strings list organizing strategies list ranking problem list scheduler list schedules list scheduling list scheduling algorithm list structure under +, #, store, select, cons, car, and cdr list structures list- and tree-structures list-oriented extension of the λ-calculus list-processing programs literal literal literal shuffle literals literals literate literate programming literature Little Little's Little's formula Litwin Litwin and Lomet live Petri net liveness liveness liveness problem liveness properties liveness properties of systems liveness property liveness requirements LK LK LK Gentzen sequent calculus LK in DAG form LK propositional sequent calculus LKA LL grammars LL languages LL linear logic LL parsers LL regular languages LL tests LL(1) grammars LL(1) languages LL(1) parsers LL(k) LL(k) chain grammars LL(k) grammar LL(k) grammars LL(k) iteration theorems LL(k) languages LL(k) left part theorem LLL LLL algorithm LLP LLP(0) grammar LLP(k) grammars LLP(k) languages LLR LLR grammars LLR grammars and languages LLR languages LL-iteration theorem LL-languages LL-regular LM LM LM program load load balancing load balancing problem load balancing problem in distributed systems load factor load-balancing local local agreement local algorithm local and global computational problems local area networks local assignments local automata local behavior local behaviour local characterization of separating and thin objects local choice local circuits local clause declarations local codes local communications local computation local computation spaces local computational problems local computations in local condition local conditions local confluence local confluence criterion local confluence theorem local consisten