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...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
710 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 |
Table des matières:
- 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.