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 75
Pagina 441
... abstract type stream are represented by values of the type t given in the implementation . Operations s , first and rest are implemented by expressions M1 , M2 , M3 . Since the value of s must be a stream , the expression M1 must have ...
... abstract type stream are represented by values of the type t given in the implementation . Operations s , first and rest are implemented by expressions M1 , M2 , M3 . Since the value of s must be a stream , the expression M1 must have ...
Pagina 581
... abstract " syntax . 2.2 . Abstract syntax Abstract syntax treats a language as a set of trees . The important thing about trees is that , unlike strings , their compositional structure is inherently unambiguous : there is only one way ...
... abstract " syntax . 2.2 . Abstract syntax Abstract syntax treats a language as a set of trees . The important thing about trees is that , unlike strings , their compositional structure is inherently unambiguous : there is only one way ...
Pagina 584
... abstract syntax is given by the grammar in Table 4 . ( This latter grammar is unambiguous , so it could be used for concrete syntax as well as abstract syntax . But in general , the grammars used for abstract syntax are highly ambiguous ...
... abstract syntax is given by the grammar in Table 4 . ( This latter grammar is unambiguous , so it could be used for concrete syntax as well as abstract syntax . But in general , the grammars used for abstract syntax are highly ambiguous ...
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