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 76
Pagina 6
... subset construction . For example , starting from the automaton of Fig . 2 one obtains by this construction the automaton of Fig . 3. It has 23 = 8 states . If we delete the states that cannot be reached from the initial state { 1 } ...
... subset construction . For example , starting from the automaton of Fig . 2 one obtains by this construction the automaton of Fig . 3. It has 23 = 8 states . If we delete the states that cannot be reached from the initial state { 1 } ...
Pagina 654
Jan van Leeuwen, Jan Leeuwen. nonempty subsets of A. As a first guess , one might take the nonempty subsets and order them by subset inclusion . However , this operation ignores the order structure on A ! Think of A as a collection of ...
Jan van Leeuwen, Jan Leeuwen. nonempty subsets of A. As a first guess , one might take the nonempty subsets and order them by subset inclusion . However , this operation ignores the order structure on A ! Think of A as a collection of ...
Pagina 1110
... subset X of U denotes the query X [ d , Σ ] = ( \ { ~ x ( r ) : r is a weak universal relation for d w.r.t. Σ } . Note that this definition gives us data models , which are parametrized by the class of dependencies of which Σ is a subset ...
... subset X of U denotes the query X [ d , Σ ] = ( \ { ~ x ( r ) : r is a weak universal relation for d w.r.t. Σ } . Note that this definition gives us data models , which are parametrized by the class of dependencies of which Σ is a subset ...
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