MARC details
| 000 -LEADER |
|---|
| fixed length control field |
01721nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520100715.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780763776275 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 267 .M69 2010 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Mozgovoy, Maxim. |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Algorithms, languages, automata, and compilers : |
| Remainder of title |
a practical approach / |
| Statement of responsibility, etc. |
Maxim Mozgovoy. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Sudbury, Massachusetts : |
| Name of publisher, distributor, etc. |
Jone and Bartlett Learning, |
| Date of publication, distribution, etc. |
c2010 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 345 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD46.48 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Ch. 1. Regular Languages and Regular Expressions -- Ch. 2. Finite Automata -- Ch. 3. The Relationship Between Finite Automata and Regular Expressions -- Ch. 4. Finite-State Machines in Practice -- Ch. 5. Nonregular Languages and Content-Free Grammars -- Ch. 6. Pushdown Automata -- Ch. 7. Parsing -- Ch. 8. Compiler Generation -- Ch. 9. The Lindenmayer Systems (L-Systems) -- Ch. 10. Turing Machines -- Ch. 11. Decidability and Complexity. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Algorithms, Languages, Automata, & Compilers A Practical Approach is designed to cover the standard “theory of computing” topics through a strong emphasis on practical applications rather than theorems and proofs. Finite automata, Turing machines, models of computation, complexity, solvability, and other topics that form a foundation of modern programming are discussed -first with a gentle theoretical orientation, and then applied through programming code and practical examples. JFLAP projects and applications are integrated throughout the book, and C# is used for all code. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
MACHINE THEORY |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
