Mathematical foundations of computer science 1975 : 4th Symposium, Mariánské Lázně, September 1-5, 1975
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
2005.
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
32 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science 1975, 4th Symposium, Mariánské Lázně, September 1-5, 1975, edited by J. Bečvář, Berlin, Springer-Verlag, 1975, 1 vol. (X-476 p.), Lecture notes in computer science, 3-540-07389-2 • Mathematical Foundations of Computer Science 1975, Texte imprimé, 9783662196823 |
| LEADER | 05539nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 945110 | ||
| 008 | 110927q2005 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155214888 | ||
| 020 | |a 9783540375852 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 001.640151 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (04 |d :1975 |c :Mariánské Lázně, République tchèque). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1975 : |b 4th Symposium, Mariánské Lázně, September 1-5, 1975 |c edited by J. Bečvář. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c 2005. | ||
| 490 | 0 | |a Lecture notes in computer science |v 32 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Construction of complete sample system for correctness testing -- Ten years of speedup -- On logics of discovery -- On models of protection in operating systems -- Parsing as a subtask of compiling -- Parallel recursive program schemes -- On some problems concerning Pawlak's machines -- Formal power series and growth functions of Lindenmayer systems -- On the representability of relations by deterministic and nondeterministic multi-tape automata -- On problems solvable by successive trials -- Automata and categories -- On some models of computability of boolean functions -- Automata and categories: Finiteness contra minimality -- Languages over free groups -- On the comparison of notions of approximation -- Non-linear speed-up theorem for two register minsky machines -- Systems of open paths in Petri nets -- On the largest full sub AFL of the full AFL of context-free languages -- On complexity of nondeterministic Turing machines computations -- On closure properties of context-free derivation complexity classes -- Control structures in single block programs -- Minimal Gödel numbers and their identification in the limit -- Isomorphic representation of automata -- Extended simple regular expressions -- Conniver programs by logical point of view -- On the set of all automata with the same monoid of endomorphisms -- Nondeterministically recognizable sets of languages -- The approximation problem in computational statistics -- The continuous algebra of monadic languages -- On sets of complex-programmed Numbers -- Decision algorithms for Havel's branching automata -- Automata and categories Input processes -- Formalization of algorithmic reasoning -- Proving program properties, symbolic evaluation and logical procedural semantics -- A contribution to error recovery -- On the analysis and synthesisproblems for context-free expressions -- Monotone switching circuits and boolean matrix product -- On some lattice-theoretic properties of generable languages -- On some formal grammars generating dependency trees -- Graph walking automata -- On finding all solutions of the partitioning problem -- Greibach normal form complexity -- On correctness and essentiality of some Ianov schemas equivalence relations -- Polynomially complete problems in the logic of automate discovery -- Relational definition of computer languages -- First-order reduction of call-by-name to call-by-value -- Local disambiguating transformation -- On cardinal sequential outer measures -- On representation of sequential and parallel functions -- The theory of the modified post algebras and multidimensional automata structures -- An algebraic theory of formal languages -- On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups -- On the synthesis of automata with several initial states -- A hierarchy of regular sequence sets -- R-fuzzy grammars -- Characterization of some classes of context-free languages in terms of complexity classes -- Inductive inference of recursive functions -- Proving properties of programs by means of predicate logic -- A generalization of Scott's flow diagrams. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Langages formels | ||
| 650 | |a Théorie des machines séquentielles | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Bečvář, Jíří, |d 1926- |4 pbd | |
| 776 | 0 | |0 016726022 |t Mathematical foundations of computer science 1975 |o 4th Symposium, Mariánské Lázně, September 1-5, 1975 |f edited by J. Bečvář |c Berlin |n Springer-Verlag |d 1975 |p 1 vol. (X-476 p.) |s Lecture notes in computer science |z 3-540-07389-2 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1975 |b Texte imprimé |z 9783662196823 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-07389-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-18XC4X02-7 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747913609 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-07389-2 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750926376 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-07389-2 |z Accès INSA CVL | |
| 997 | |0 945110 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||