Mathematical foundations of computer science 1984 : proceedings, 11th symposium, Praha, Czechoslovakia, September 3-7, 1984 : MFCS '84
Wedi'i Gadw mewn:
| Awdur Corfforaethol: | |
|---|---|
| Awduron Eraill: | , |
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Cyfres: | Lecture notes in computer science
176 |
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
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 1984, proceedings, 11th symposium, Praha, Czechoslovakia, September 3-7, 1984, MFCS '84, edited by M.P. Chytil and V. Koubek, Berlin, Springer-Verlag, 1984, 1 vol. (XI-581 p.), Lecture notes in computer science, 3-540-13372-0 • Mathematical Foundations of Computer Science 1984, Texte imprimé, 9783662187708 |
| LEADER | 05978nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 944138 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155176234 | ||
| 020 | |a 9783540389293 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (11 |d :1984 |c :Prague, République tchèque). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1984 : |b proceedings, 11th symposium, Praha, Czechoslovakia, September 3-7, 1984 : MFCS '84 |c edited by M.P. Chytil and V. Koubek. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 176 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Separating, strongly separating, and collapsing relativized complexity classes -- Complexity of quantifier elimination in the theory of algebraically closed fields -- Systolic automata power, characterizations, nonhomogeneity -- A note on unique decipherability -- Outline of an algebraic language theory -- Thue systems and the Church-Rosser property -- Limits, higher type computability and type-free languages -- Traces, histories, graphs: Instances of a process monoid -- Recent results on automata and infinite words -- VLSI algorithms and architectures -- Decidability of monadic theories -- On the Ehrenfeucht conjecture on test sets and its dual version -- Sparse oracles, lowness, and highness -- Computability of probabilistic parameters for some classes of formal languages -- A truely morphic characterization of recursively enumerable sets -- On the Herbrand Kleene universe for nondeterministic computations -- An investigation of controls for concurrent systems by abstract control languages -- On generalized words of Thue-Morse -- Nondeterminism is essential for two-way counter machines -- Weak and strong fairness in CCS -- On the complexity of inductive inference -- Monotone edge sequences in line arrangements and applications -- Many-sorted temporal logic for multi-processes systems -- Process logics : two decidability results -- On searching of special classes of mazes and finite embedded graphs -- The power of the future perfect in program logics -- Hierarchy of reversal and zerotesting bounded multicounter machines -- On the power of alternation in finite automata -- The equivalence problem and correctness formulas for a simple class of programs -- Lower bounds for polygon simplicity testing and other problems -- A uniform independence of invariant sentences -- On the equivalence ofcompositions of morphisms and inverse morphisms on regular languages -- Some connections between presentability of complexity classes and the power of formal systems of reasoning -- Finding a maximum flow in /s,t/-planar network in linear expected time -- Nondeterministic logspace reductions -- Factoring multivariate polynomials over algebraic number fields -- Gödel numberings, principal morphisms, combinatory algebras -- Representations of integers and language theory -- New lower bound for polyhedral membership problem with an application to linear programming -- Decidability of the equivalence problem for synchronous deterministic pushdown automata -- Models and operators for nondeterministic processes -- Algorithms for string editing which permit arbitrarily complex edit constraints -- The structure of polynomial complexity cores -- Solving visibility problems by using skeleton structures -- Another look at parameterization using algebras with subsorts -- A lower bound on complexity of branching programs -- From dynamic algebras to test algebras -- Combinatorial games with exponential space complete decision problems -- Fast recognitions of pushdown automaton and context-free languages -- Multiprocessor systems and their concurrency -- Free constructions in algebraic institutions -- Remarks on comparing expressive power of logics of programs -- The complexity of problems concerning graphs with regularities -- On the complexity of slice functions -- An exponential lower bound for one-time-only branching programs -- A topological view of some problems in complexity theory -- Propositional dynamic logic with strong loop predicate. | |
| 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 Logique symbolique et mathématique | ||
| 650 | |a Mathématiques | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Chytil, Michal, |d 1949- |4 pbd | |
| 700 | 1 | |a Koubek, Václav, |d 1948-2016. |4 pbd | |
| 776 | 0 | |0 025892932 |t Mathematical foundations of computer science 1984 |o proceedings, 11th symposium, Praha, Czechoslovakia, September 3-7, 1984 |o MFCS '84 |f edited by M.P. Chytil and V. Koubek |c Berlin |n Springer-Verlag |d 1984 |p 1 vol. (XI-581 p.) |s Lecture notes in computer science |z 3-540-13372-0 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1984 |b Texte imprimé |z 9783662187708 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0030285 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-FR94W9KZ-2 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747922403 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0030285 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750934751 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0030285 |z Accès INSA CVL | |
| 997 | |0 944138 |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/ | ||