Handbook of Theoretical Computer ScienceJan van Leeuwen, Jan Leeuwen Elsevier Science, 15 nov 2005 - 2269 pagina's Presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing. |
Vanuit het boek
Resultaten 1-3 van 84
Pagina 393
... ( fix F ) will be a fixed point of F. However , by imposing relatively natural conditions on F ( or the basic functions used to define F ) , we can guarantee that this countable union is a fixed point . In fact , since any fixed point of ...
... ( fix F ) will be a fixed point of F. However , by imposing relatively natural conditions on F ( or the basic functions used to define F ) , we can guarantee that this countable union is a fixed point . In fact , since any fixed point of ...
Pagina 430
... fixed - point operators . By the Basic Lemma , it suffices to find logical relations which relate fixed - point operators fix , for each σ . Since we often construct logical relations by choosing relations at base type , and then ...
... fixed - point operators . By the Basic Lemma , it suffices to find logical relations which relate fixed - point operators fix , for each σ . Since we often construct logical relations by choosing relations at base type , and then ...
Pagina 640
... fix is a uniform fixed point operator . What is less obvious , and somewhat more surprising , is the following theorem . 2.3 . THEOREM . fix is the unique uniform fixed point operator . PROOF . To see why this must be the case , let D ...
... fix is a uniform fixed point operator . What is less obvious , and somewhat more surprising , is the following theorem . 2.3 . THEOREM . fix is the unique uniform fixed point operator . PROOF . To see why this must be the case , let D ...
Inhoudsopgave
Dominique PERRIN | 3 |
PREFACE LIST OF CONTRIBUTORS TO VOLUME B CONTENTS CHAPTER 1 FINITE AUTOMATA D Perrin 1 Introduction | 4 |
Finite automata and recognizable sets | 10 |
Copyright | |
41 andere gedeelten niet getoond
Overige edities - Alles bekijken
Veelvoorkomende woorden en zinsdelen
A₁ abstraction algebraic algorithm alphabet applicative structure automaton axioms B₁ Berlin binary Büchi automata Cartesian closed categories Church-Rosser clause complete Computer Science congruence consider context-free grammar context-free languages Corollary Courcelle critical pairs defined definition denote derivation Dershowitz deterministic elements empty equations example exists expressions F-algebra first-order formula free variable function Functional Programming given graph Hence Henkin models Herbrand hypergraphs induction infinite trees integer interpretation lambda abstraction Lecture Notes Lemma logic programming logical relations mapping monadic monadic second-order monoid morphism multiset natural numbers nonempty normal form Notes in Computer notion operations ordering polymorphic predicate problem Proc program schemes programming languages proof properties Proposition prove recursive reduction regular result rewriting systems satisfying second-order logic Section semantics sequence Springer subset substitution subterm symbols Symp t₁ terminating Theorem theory tree automata tree automaton type inference typed lambda calculus U₁ w-languages w-words word