Fundamentals of computation theory : proceedings of the 1977 International FCT-Conference, Poznań-Kórnik, Poland, September 19-23, 1977
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Institution som forfatter: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
56 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fundamentals of computation theory, proceedings of the 1977 International FCT-Conference, Poznań-Kórnik, Poland, September 19-23, 1977, edited by Marek Karpiński, Berlin, Springer-Verlag, 1977, 1 vol. (XI-542 p.), Lecture notes in computer science, 3-540-08442-8 • Fundamentals of Computation Theory, Texte imprimé, 9783662199145 |
| LEADER | 05746nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 944211 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155179144 | ||
| 020 | |a 9783540370840 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 511.3 | ||
| 111 | 2 | |a International FCT-Conference |n (01 |d :1977 |c :Poznań / Kórnik, Pologne). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : |b proceedings of the 1977 International FCT-Conference, Poznań-Kórnik, Poland, September 19-23, 1977 |c edited by Marek Karpiński. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 56 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Methodology of proving a finite-state stochastic representability and nonrepresentability -- Non deterministic recursive program schemes -- Some remarks on relational composition in computational theory and practice -- An axiomatization of the rational data objects -- Some recent results on recognizable formal power series -- Canonical forms of context-free grammars and position restricted grammar forms -- Environments, labyrinths and automata -- Automata in labyrinths -- Stochastic algebras and stochastic automata over general measurable spaces: Algebraic theory and a decomposition theorem -- Some remarks on the algebra of automaton mappings -- Algebraic semantics of type definitions and structured variables -- Universal algebras and tree automata -- Vectors of coroutines over blikle nets -- Initial algebraic semantics for non context-free languages -- Reading functions and an extension of Kleene theorem for some families of languages -- Operations on ?-regular languages -- On the relation between graph grammars and graph L-systems -- On the theory of syntactic monoids for rational languages -- The equivalence of schemata with some feedbacks -- Disjunctive languages and codes -- Families of R-fuzzy Languages -- Algebras of partial sequences A tool to deal with concurrency -- Remarks on fixed points of functors -- Recognizable and regular languages in a category -- Free dynamics and algebraic semantics -- Efficient state-splitting -- Nets over many sorted operator domains and their semantics -- Embedding theorems in the algebraic theory of graph grammars -- Some "geometrical" categories associated with flowchart schemes -- On partial recursive definitions and programs -- Transformations of derivation sequences in graph grammars -- Applicability of a production in a categorical grammar -- Onorder-complete universal algebra and enriched functorial semantics -- Functorial semantics of the type free ?-?? calculus -- A more categorical model of universal algebra -- Graph grammars -- Fixed-points and algebras with infinitely long expressions, II -- Relational automata in a category and their languages -- Generalized linton algebras -- On analysis of protoschemes -- Using determinancy of games to eliminate quantifiers -- Non-generable RE sets -- Polynomial time algorithms in the theory of linear diophantine equations -- Complexity of common subsequence problems -- Complexity of sequence encodings -- Network complexity -- On computability of Kolmogorov complexity -- The equivalences problems for binary EOL-Systems are decidable -- On a theory of inductive inference -- On finite and infinite computations -- Expected behavior of graph coloring algorithms -- Two NP-complete problems related to information retrieval -- On properties of certain synchronizing tool for parallel computations -- The parallel complexity of arithmetic computation -- Maximal rectangular relations -- A Dushnik - Miller type dimension of graphs and its complexity -- Programmability and P=NP conjecture -- An algorithmic approach to set theory -- Decidability of ? Trees with bounded sets A survey -- Empty - storage - acceptance of ? - languages -- Degrees of circuit complexity -- Recursive ?-languages -- A generalized computability thesis. | |
| 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 Automates mathématiques, Théorie des | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Théorie de la récursivité | ||
| 650 | |a Catégories (mathématiques) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Karpiński, Marek. |4 aut | |
| 776 | 0 | |0 018221777 |t Fundamentals of computation theory |o proceedings of the 1977 International FCT-Conference, Poznań-Kórnik, Poland, September 19-23, 1977 |f edited by Marek Karpiński |c Berlin |n Springer-Verlag |d 1977 |p 1 vol. (XI-542 p.) |s Lecture notes in computer science |z 3-540-08442-8 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662199145 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-08442-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-V0FX6NJ1-Z |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747921784 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-08442-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750934174 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-08442-8 |z Accès INSA CVL | |
| 997 | |0 944211 |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/ | ||