书目详情:
CONTENTSPrefaceHazard Algebras Extended Abstract)1 Introduction2 Transients3 Change-Counting Algebra4 Counting Changes to a Threshold5 Circuit Simulations6 Extensions of Boolean Functions7 Complexity Issues8 ConclusionsReferencesUndecidability and Incompleteness Results in Automata Theory1 Introduction2 Basic Concepts and II2-Completeness3 Undecidability and Incompleteness Results4 Representation Independent Incompleteness Results5 Incomplete Languages6 Minimal Automata and Incompleteness7 Succinctness Results8 ConclusionReferencesAutomata Theory: Its Past and Future1 Introduction2 Beginnings of Automata Theory3 External Changes Impacting Future Directions4 ConclusionsReferencesForty Years of Formal Power Series in Automata Theory1 Introduction2 Continuous monoids and semirings3 Automata and the Theorem of Kleene4 Algebraic systems and pushdown automata5 Principal cones of algebraic power series6 Decidability questionsReferencesPlaying Infinite Games in Finite Time1 Infinite games2 The score function3 Theoretical results about scoring4 When to end the play5 Finding playable games6 A specific suggestionReferencesGene Assembly in Ciliates: Computing by Folding and RecombinationIntroduction.1 Preliminaries.2 DNA molecules: structure and notation.3 Gene assembly in ciliates.4 Molecular operations for gene assembly.5 MDS structures and descriptors.6 String pointer reduction systems.7 Graph pointer reduction systems.8 Universality and simplicity.9 Patterns of micronuclear genes.DiscussionReferencesCompositions over a Finite Domain: From Completeness to Synchronizable Automata1 Introduction2 Depth and complete depth3 Depth of constants4 Functions of several variables5 Forcing long composition sequences6 ConclusionReferencesAppendix Brief Biographies of the AuthorsJANUSZ JOHN) A. BRZOZOWSKIJURIS HARTMANISJOHN E. HOPCROFTWERNER KUICHROBERT MCNAUGHTONGRZEGORZ ROZENBERGARTO SALOMAA
评论:

