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 57
Pagina 620
... execution of G , when possible . Let us regard the former as equivalent to an empty statement when it is not possible to execute G. With the latter , the execution of G is repeated , as many times as possible . We take the denotations ...
... execution of G , when possible . Let us regard the former as equivalent to an empty statement when it is not possible to execute G. With the latter , the execution of G is repeated , as many times as possible . We take the denotations ...
Pagina 622
... executed concurrently and asynchronously . If S , and S2 use the same variables , the result of their concurrent execution may depend on the order in which the " steps " of S1 are executed in relation to those of S2 , i.e. , on the ...
... executed concurrently and asynchronously . If S , and S2 use the same variables , the result of their concurrent execution may depend on the order in which the " steps " of S1 are executed in relation to those of S2 , i.e. , on the ...
Pagina 876
Jan van Leeuwen, Jan Leeuwen. 6.1 . Execution traces We use execution traces to record the successive configurations that can be encountered during a terminating or nonterminating execution of a program . Since programs are ...
Jan van Leeuwen, Jan Leeuwen. 6.1 . Execution traces We use execution traces to record the successive configurations that can be encountered during a terminating or nonterminating execution of a program . Since programs are ...
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