|
|
|
|
| LEADER |
00000cam a22000007a 4500 |
| 001 |
9001d5a2-6e01-448e-8e26-5f3ec9568180 |
| 005 |
20240707000000.0 |
| 008 |
010828s2001 si a b 001 0 eng d |
| 010 |
|
|
|a 2001273994
|
| 020 |
|
|
|a 9810245009
|
| 020 |
|
|
|a 9789810245009
|
| 035 |
|
|
|a (MnManS)002848061SYS01
|
| 035 |
|
|
|a ocm47542707
|
| 035 |
|
|
|a (EXLNZ-01MNPALS_NETWORK)9910045846104266
|
| 040 |
|
|
|a IUA
|b eng
|c IUA
|d DLC
|d ZCU
|d COD
|d BAKER
|d LVB
|d YDXCP
|d DEBBG
|d OCLCF
|d NAM
|
| 042 |
|
|
|a lccopycat
|
| 049 |
|
|
|a XMN@
|
| 050 |
0 |
0 |
|a QA267
|b .F555 2001
|
| 082 |
0 |
0 |
|a 511.3
|2 21
|
| 084 |
|
|
|a ST 130
|2 rvk
|
| 100 |
1 |
|
|a Fleck, Arthur Charles.
|
| 245 |
1 |
0 |
|a Formal models of computation :
|b the ultimate limits of computing /
|c Arthur Fleck.
|
| 260 |
|
|
|a Singapore ;
|a River Edge, NJ :
|b World Scientific,
|c c2001.
|
| 300 |
|
|
|a xiv, 532 p. :
|b ill. ;
|c 22 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|
| 490 |
1 |
|
|a AMAST series in computing ;
|v vol. 7
|
| 504 |
|
|
|a Includes bibliographical references (p. 523-528) and index.
|
| 505 |
0 |
|
|a Mathematical Preliminaries -- Pt. I. The Finite State Paradigm -- Ch. 1. Regular Expression and Acceptors -- Ch. 2. Properties of Regular Languages -- Ch. 3. Transducers and Other Variations -- Pt. II. Context-free Grammars and Automata -- Ch. 4. Basic Grammar Definitions -- Ch. 5. Pushdown Store Automata -- Ch. 6. Properties of Context-free Languages -- Pt. III. General Computability Models -- Ch. 7. Context-sensitive Languages -- Ch. 8. Turning Machines and Computability -- Ch. 9. The Universal Machine and Impossible Computations.
|
| 583 |
1 |
|
|a committed to retain
|c 07012023
|d 12312042
|f Minnesota Shared Print Program
|5 MnManS
|z MNSU, Mankato Retention Commitment
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Formal languages.
|
| 650 |
|
0 |
|a Computational complexity.
|
| 650 |
|
6 |
|a Automates mathématiques, Théorie des.
|
| 650 |
|
6 |
|a Langages formels.
|
| 650 |
|
6 |
|a Complexité de calcul (Informatique)
|
| 650 |
|
7 |
|a Computational complexity.
|2 fast
|0 (OCoLC)fst00871991
|
| 650 |
|
7 |
|a Formal languages.
|2 fast
|0 (OCoLC)fst00932922
|
| 650 |
|
7 |
|a Machine theory.
|2 fast
|0 (OCoLC)fst01004846
|
| 650 |
0 |
7 |
|a Datenverarbeitung.
|2 swd
|
| 650 |
0 |
7 |
|a Theoretische Informatik.
|2 swd
|
| 650 |
|
4 |
|a Automates mathématiques, Théorie des.
|
| 650 |
|
4 |
|a Complexité de calcul (Informatique)
|
| 650 |
|
4 |
|a Langages formels.
|
| 650 |
0 |
7 |
|a Datenverarbeitung.
|0 (DE-588)4011152-0
|2 gnd
|
| 650 |
0 |
7 |
|a Theoretische Informatik.
|0 (DE-588)4196735-5
|2 gnd
|
| 830 |
|
0 |
|a AMAST series in computing ;
|v vol. 7.
|
| 999 |
1 |
0 |
|i 9001d5a2-6e01-448e-8e26-5f3ec9568180
|l 990028480610104301
|s US-MNMANS
|m formal_models_of_computationultimate_limits_of_computing___________________2001_______worlda________________________________________fleck__arthur_charle_______________p
|
| 999 |
1 |
0 |
|i 9001d5a2-6e01-448e-8e26-5f3ec9568180
|l 9936168480001701
|s US-MNU
|m formal_models_of_computationultimate_limits_of_computing___________________2001_______worlda________________________________________fleck__arthur_charle_______________p
|
| 999 |
1 |
1 |
|l 990028480610104301
|s ISIL:US-MNMANS
|i Minnesota State University, Mankato
|t BKS
|a GEN
|c QA267 .F555 2001
|b 30101017734740
|x BOOK
|y 2376633350004301
|p LOANABLE
|
| 999 |
1 |
1 |
|l 9936168480001701
|s ISIL:US-MNU
|i University of Minnesota
|t BKS
|a TSCIGEN
|c QA267 .F54x 2001
|d LCC
|b 31951D021699184
|x BOOK
|y 23407972330001701
|p LOANABLE
|