Fundamentals of computation theory : 9th International Conference, FCT '93 Szeged, Hungary, August 23 27, 1993 : proceedings
This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and formal specification - A...
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
710 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, 9th International Conference, FCT'93, Szeged, Hungary, August 23-27, 1993, proceedings, Zoltán Ésik (Ed.), 1993, Berlin, Springer-Verlag, 1 vol. (IX-471 p.), Lecture notes in computer science, 3-540-57163-9 • Fundamentals of Computation Theory, Texte imprimé, 9783662189696 |
| LEADER | 05566nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 945321 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155223151 | ||
| 020 | |a 9783540479239 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on fundamentals of computation theory |n (09 |d :1993 |c :Szeged). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : |b 9th International Conference, FCT '93 Szeged, Hungary, August 23 27, 1993 : proceedings |c [edited by] Zoltán Ésik. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 710 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Rewriting, möbius functions and semi-commutations -- Simulations between different models of parallel computers -- Dense and disjunctive properties of languages -- The hierarchy of codes -- Five facets of hyperedge replacement beyond context-freeness -- An action structure for synchronous ?-calculus -- AC0 circuit complexity -- Pattern languages: Problems of decidability and generation -- General solution of mirror equation -- Decidability of equivalence for linear letter to letter top-down tree transducers -- Translations between flowchart schemes and process graphs -- Local equational logic -- Liveness of weighted circuits and the diophantine problem of Frobenius -- Context-free graph grammars: Separating vertex replacement from hyperedge replacement -- Formal languages consisting of primitive words -- Undecidability of the surjectivity problem for 2D cellular automata: A simplified proof -- Efficient interpretation of state charts -- Implementation of a universal unification algorithm for macro tree transducers -- Finding maximum convex polygons -- Approximations with axis-aligned rectangles (extended abstract) -- Vector sequence analysis and full weak safety for concurrent systems -- Does transitivity help? On the complexity of poset properties -- Generalized topological sorting in linear time -- Easily checked self-reducibility -- On the complexities of linear LL(1) and LR(1) grammars -- On the relation between firing sequences and processes of Petri nets -- Maximum covering with D cliques -- Monotonically labelled ordered trees and multidimensional binary trees -- A maximum path length pumping lemma for edge-replacement languages -- Regular approximations to shuffle products of context-free languages, and convergence of their generating functions -- The equational theory of a Boolean monad.-Non erasing Taring machines: a frontier between a decidable halting problem and Universality -- On scattered syntactic monoids -- Regular tree languages without unary symbols are star-free -- One-way cellular automata on cayley graphs -- ON tree pattern unification problems -- Structural Equivalence and ETOL grammars -- A hierarchy of deterministic top-down tree transformations -- Synthesis of O(lg n) testable trees -- On the learnability of a restricted predicate formulae. | |
| 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 | ||
| 520 | |a This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and formal specification - Automata and formal languages - Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) - Algorithms (efficient, probabilistic, parallel, sequential, distributed) - Counting and combinatorics in connection with mathematical computer science The volume contains the texts of 8 invitedlectures and 32 short communications selected by the international program committee from a large number of submitted papers. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Ésik, Zoltán. |4 pbd | |
| 776 | 0 | |0 017407206 |t Fundamentals of computation theory |o 9th International Conference, FCT'93, Szeged, Hungary, August 23-27, 1993 |o proceedings |f Zoltán Ésik (Ed.) |d 1993 |c Berlin |n Springer-Verlag |p 1 vol. (IX-471 p.) |s Lecture notes in computer science |z 3-540-57163-9 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662189696 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-57163-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-ZPC1W23G-G |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747911622 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-57163-9 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750924411 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-57163-9 |z Accès INSA CVL | |
| 997 | |0 945321 |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/ | ||