Cargando…
Handbook of Mathematical Models for Languages and Computation /
The book comprises 20 chapters dealing with the following subjects: mathematical models for languages and computation; sets; sequences; relations; functions; graphs; classical models; finite automata; context-free grammars; pushdown automata; Turing machines; computability; decidability; context-dep...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Stevenage :
IET,
2019
|
| Colección: | Professional applications of computing series ;
26. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | KNOVEL_on1132299188 | ||
| 003 | OCoLC | ||
| 005 | 20231027140348.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 191216t20192020enka ob 001 0 eng d | ||
| 040 | |a STF |b eng |e rda |e pn |c STF |d OCLCO |d UIU |d YDX |d EBLCP |d CUS |d OCLCF |d N$T |d UKAHL |d OCLCQ |d CUV |d VLB |d OCL |d OCLCO |d K6U |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 1136871511 |a 1137018162 |a 1138030686 |a 1148401657 | ||
| 020 | |a 1785616609 |q electronic bk. | ||
| 020 | |a 9781785616600 |q electronic bk. | ||
| 020 | |a 9781523127443 |q electronic bk. | ||
| 020 | |a 1523127449 |q electronic bk. | ||
| 020 | |z 9781785616594 | ||
| 020 | |z 1785616595 | ||
| 035 | |a (OCoLC)1132299188 |z (OCoLC)1136871511 |z (OCoLC)1137018162 |z (OCoLC)1138030686 |z (OCoLC)1148401657 | ||
| 050 | 4 | |a QA76.9.N38 | |
| 072 | 7 | |a C0000 |2 inspec | |
| 072 | 7 | |a C4210L |2 inspec | |
| 072 | 7 | |a C4220 |2 inspec | |
| 072 | 7 | |a C6140 |2 inspec | |
| 072 | 7 | |a C6180N |2 inspec | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Meduna, Alexander, |d 1957- |e author. | |
| 245 | 1 | 0 | |a Handbook of Mathematical Models for Languages and Computation / |c Alexander Meduna, Petr Horacek, Martin Tomko |
| 264 | 1 | |a Stevenage : |b IET, |c 2019 | |
| 264 | 4 | |c ©2020 | |
| 300 | |a 1 online resource |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a IET professional applications of computing series |v 26 | |
| 588 | 0 | |a Online resource; title from PDF title page (viewed on August 11, 2020) | |
| 504 | |a Includes bibliographical references and index | ||
| 520 | |a The book comprises 20 chapters dealing with the following subjects: mathematical models for languages and computation; sets; sequences; relations; functions; graphs; classical models; finite automata; context-free grammars; pushdown automata; Turing machines; computability; decidability; context-dependent grammars; regulated models; parallel grammatical models; jumping models; deep pushdown automata; syntax analysis; programming languages; natural languages; and biology | ||
| 590 | |a Knovel |b ACADEMIC - Software Engineering | ||
| 650 | 0 | |a Computational linguistics. | |
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 6 | |a Linguistique informatique. | |
| 650 | 6 | |a Informatique |x Mathématiques. | |
| 650 | 7 | |a computational linguistics. |2 aat | |
| 650 | 7 | |a Computer science |x Mathematics |2 fast | |
| 650 | 7 | |a Computational linguistics |2 fast | |
| 650 | 7 | |a automata theory. |2 inspect | |
| 650 | 7 | |a computability. |2 inspect | |
| 650 | 7 | |a computational linguistics. |2 inspect | |
| 650 | 7 | |a decidability. |2 inspect | |
| 650 | 7 | |a grammars. |2 inspect | |
| 650 | 7 | |a natural languages. |2 inspect | |
| 650 | 7 | |a programming languages. |2 inspect | |
| 653 | |a biology | ||
| 653 | |a natural languages | ||
| 653 | |a programming languages | ||
| 653 | |a syntax analysis | ||
| 653 | |a deep pushdown automata | ||
| 653 | |a jumping models | ||
| 653 | |a parallel grammatical models | ||
| 653 | |a regulated models | ||
| 653 | |a context-dependent grammars | ||
| 653 | |a decidability | ||
| 653 | |a computability | ||
| 653 | |a Turing machines | ||
| 653 | |a pushdown automata | ||
| 653 | |a context-free grammars | ||
| 653 | |a finite automata | ||
| 653 | |a classical models | ||
| 653 | |a graphs | ||
| 653 | |a functions | ||
| 653 | |a relations | ||
| 653 | |a sequences | ||
| 653 | |a sets | ||
| 653 | |a computation | ||
| 653 | |a mathematical models | ||
| 700 | 1 | |a Horáček, Petr |e author | |
| 700 | 1 | |a Tomko, Martin |e author | |
| 776 | 0 | 8 | |i Print version |z 1785616595 |z 9781785616594 |w (OCoLC)1107444199 |
| 830 | 0 | |a Professional applications of computing series ; |v 26. | |
| 856 | 4 | 0 | |u https://appknovel.uam.elogim.com/kn/resources/kpHMMLC003/toc |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n BDZ0040221531 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL6026426 | ||
| 938 | |a EBSCOhost |b EBSC |n 2345950 | ||
| 938 | |a YBP Library Services |b YANK |n 301053378 | ||
| 994 | |a 92 |b IZTAP | ||