sitemap | contact us
  Book Series
  Book Proposal Form
  Using Published Material
  Rights and Permissions
  Examination Copies
  List of Publishers
  About Narosa
  Group Companies
  Our Strength
view in print mode
Automata, Graphs and Logic
Editor(s): D. Gnanaraj Thomas, Robinson Thamburaj

ISBN:    978-81-8487-649-9 
Publication Year:   2019
Pages:   220
Binding:   Hard Back
Dimension:   160mm x 240mm
Weight:   491


About the book

AUTOMATA, GRAPHS AND LOGIC are three key areas of current research in theoretical computer science and discrete mathematics. This book addresses important issues like automata and verification, automata and computational complexity, connections among automata, logic and graphs, applications of logic in software testing and certain interesting results on these topics. Exhibiting interconnections among these topics are of great benefit to the students, teachers and research community.

Table of Contents

Foreword / Preface / Automata Models for Verification of Services with Unboundedly Many Clients / Logic as Regular Behavior / Verification, Automat, and Learning / Logic in Software Testing / Checking MSO Definable Properties on Classes of Finite Graphs with Bounded Tree Width / Connections between Automata Theory and Computational Complexity / Words, Sub words and Parikh Matrices / Random Grid Schemes with High Information Rate / Rational Graphs and Logic / Tag Systems and Cryptography / Recognizability of Triangular Tiling Patterns by Tiling System / Reachability Problems in Petri Net Theory / Generalized Parikh Vectors and Parikh Matrices of 2D Binary Arrays / Anti-Diagonal Matrix: A Variant of Parikh Matrix / Closure Operations on Parallel Communicating String-Graph Grammar System / A New Automaton for Hexagonal Picture Languages / Inferring Subclass of Internal Contextual Grammars with Local maximum Selector / Picture Generating P Systems Based on (L/U) Mode Pure 2d Context Free Grammar With Conditional Rewriting / Wiener Index of Certain Common Neighborhood Graphs / Quad tree Based Secure Least Significant Bit Watermarking / Wiener Index of Y-Tree and its Common Neighborhood Graph / Crossing Numbers for Join of Graphs with Stars


Postgraduate Students, Professionals and Researchers


| Companies | Mission | Strength | Values | History | Contact us
© Narosa Publishing House