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 70
Pagina 585
... implementation - independent , consisting of just those features of program execution that are common to all implementations . The implementation - independent semantics of a program may typically be modelled mathematically as a ...
... implementation - independent , consisting of just those features of program execution that are common to all implementations . The implementation - independent semantics of a program may typically be modelled mathematically as a ...
Pagina 760
... implementations will be discussed in Section 8.3 . 8.1 . Implementation by refinement A specification SP1 incorporates more design decisions than a specification SP if SP1 has the same signature as SP and all models of SP1 are models of ...
... implementations will be discussed in Section 8.3 . 8.1 . Implementation by refinement A specification SP1 incorporates more design decisions than a specification SP if SP1 has the same signature as SP and all models of SP1 are models of ...
Pagina 763
... implemented by TREE S ( NAT , p ) , i.e. , behavior SETNAT w.r.t. { bool } ~ TREE S ( NAT1 , p ) . 8.2 . Other notions of implementation As the examples in Example 8.1.2 . suggest , the construction of an implementation of a ...
... implemented by TREE S ( NAT , p ) , i.e. , behavior SETNAT w.r.t. { bool } ~ TREE S ( NAT1 , p ) . 8.2 . Other notions of implementation As the examples in Example 8.1.2 . suggest , the construction of an implementation of a ...
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