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 87
Pagina 4
... give a complete proof of Schützenberger's theorem , stating the equality between star - free sets and aperiodic sets . We further give , with partial proofs , the syntactic characterization of two important subfamilies of star - free ...
... give a complete proof of Schützenberger's theorem , stating the equality between star - free sets and aperiodic sets . We further give , with partial proofs , the syntactic characterization of two important subfamilies of star - free ...
Pagina 626
... give semantic equations that define appropriate ( but not necessarily fully abstract ) denotations . However , the ... give complete descriptions of useful languages . 6.2 . Exposition There are several expository works that explain the ...
... give semantic equations that define appropriate ( but not necessarily fully abstract ) denotations . However , the ... give complete descriptions of useful languages . 6.2 . Exposition There are several expository works that explain the ...
Pagina 628
... give modular semantic descriptions of programming languages . Their framework is first - order , and not strictly compositional ; but higher - order algebras , which give the power of ¿ -notation in an algebraic framework [ 39 , 42 , 12 ] ...
... give modular semantic descriptions of programming languages . Their framework is first - order , and not strictly compositional ; but higher - order algebras , which give the power of ¿ -notation in an algebraic framework [ 39 , 42 , 12 ] ...
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