Listing 1 - 10 of 11 | << page >> |
Sort by
|
Choose an application
Graph theory. --- Parsing (Computer grammar) --- Parsers (Computer grammar) --- Computational linguistics --- Formal languages --- Generative grammar --- Grammar, Comparative and general --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems
Choose an application
Choose an application
Choose an application
In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among others, algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching. This book has been used for advanced undergraduate and graduate courses on automata and formal languages, and assumes some prior exposure to the basic notions in that area. Sample programs are presented in Java and Prolog.
Computer science --- Computer. Automation --- toegepaste informatica --- computers --- software engineering --- computerkunde
Choose an application
Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general. Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages. The book also examines decidable and undecidable problems with emphasis on the case for context-free languages. Topics and features: Provides theorems, examples, and exercises to clarify automata-languages correspondences Presents some fundamental techniques for parsing both regular and context-free languages Classifies subclasses of decidable problems, avoiding focus on the theory of complexity Examines finite-automata minimalization and characterization of their behavior using regular expressions Illustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms Offers supplementary material on counter machines, stack automata, and abstract language families This highly useful, varied text/reference is suitable for undergraduate and graduate courses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic. Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.
Computer science --- computers --- computerkunde --- Human-computer interaction. --- Formal languages.
Choose an application
Human-computer interaction. --- Formal languages. --- Formalization (Linguistics) --- Language and languages --- Machine theory --- Computer-human interaction --- Human factors in computing systems --- Interaction, Human-computer --- Human engineering --- User-centered system design --- User interfaces (Computer systems)
Choose an application
Choose an application
Automatic Program Development is a tribute to Robert Paige (1947-1999), our accomplished and respected colleague, and moreover our good friend, whose untimely passing was a loss to our academic and research community. We have collected the revised, updated versions of the papers published in his honor in the Higher-Order and Symbolic Computation Journal in the years 2003 and 2005. Among them there are two papers by Bob: (i) a retrospective view of his research lines, and (ii) a proposal for future studies in the area of the automatic program derivation. The book also includes some papers by members of the IFIP Working Group 2.1 of which Bob was an active member. All papers are related to some of the research interests of Bob and, in particular, to the transformational development of programs and their algorithmic derivation from formal specifications. Automatic Program Development offers a renewed stimulus for continuing and deepening Bob's research visions. A familiar touch is given to the book by some pictures kindly provided to us by his wife Nieba, the personal recollections of his brother Gary and some of his colleagues and friends.
Computer algorithms. --- Program transformation (Computer programming) --- Programming (Mathematics) --- Mathematical programming --- Goal programming --- Algorithms --- Functional equations --- Mathematical optimization --- Operations research --- Computer program optimization --- Computer program transformation --- Optimization of computer programs --- Transformation of computer programs --- Computer programming --- Software engineering. --- Computer science. --- Software Engineering/Programming and Operating Systems. --- Software Engineering. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Informatics --- Science --- Computer software engineering --- Engineering --- Computer programming. --- Programming languages (Electronic computers). --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Programming
Choose an application
Programming --- Computer. Automation --- computerbesturingssystemen --- programmeren (informatica) --- programmeertalen --- software engineering
Choose an application
Logic programming --- Programmation logique --- Congresses. --- Congrès --- 681.3*D16 --- 681.3*D11 --- 681.3*F31 --- 681.3*F41 --- 681.3*I22 --- Computerwetenschap--?*D16 --- Applicative (functional) programming --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Computer Science --- Engineering & Applied Sciences --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D11 Applicative (functional) programming --- Congrès --- Computer science. --- Architecture, Computer. --- Software engineering. --- Computer programming. --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Computer System Implementation. --- Logics and Meanings of Programs. --- Programming Techniques. --- Artificial Intelligence (incl. Robotics). --- Mathematical Logic and Formal Languages. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Computer software engineering --- Engineering --- Architecture, Computer --- Informatics --- Science --- Programming --- Computer network architectures. --- Logic design. --- Artificial Intelligence. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Logic programming - Congresses
Listing 1 - 10 of 11 | << page >> |
Sort by
|