Computation theory : fifth symposium, Zaborow, Poland, December 3-8, 1984 : proceedings
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
208 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | 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: | • Computation theory, proceedings, Fifth symposium, Zaborow, Poland, December 3-8, 1984, ed. by Andrzej Skowron, Berlin, Springer, 1985, 1 vol. (VII-397 p.), Lecture notes in computer science, 3-540-16066-3 • Computation Theory, Texte imprimé, 9783662194881 |
جدول المحتويات:
- An algorithmic interface structure for pascal compilers
- Nonuniform complexity classes, decision graphs and homological properties of posets
- On the control of concurrent systems by restrictions of the state behaviour
- From domino tilings to a new model of computation
- Nondeterministic Propositional Dynamic Logic with intersection is decidable
- A note on selection networks
- Correctness of inconsistent theories with notions of feasibility
- On the log-space reducibility among array languages /preliminary version/
- Non-uniformity of dynamic logic
- Model theory of propositional logics of programs, some open problems
- Some results on decision trees with relations to computational trees
- Propositional calculi of term satisfiability and process logics
- On the effectiveness of some operations on algorithms
- Concatenation of program modules an algebraic approach to the semantic and implementation problems
- Regular expressions for infinite trees and a standard form of automata
- Equational ?-calculus
- A logic of indiscernibility relations
- Rough sets and decision tables
- On learning a rough set approach
- A methodology for improving parallel programs by adding communications
- Extension of PDL and consequence relations
- Rough-sets based learning systems
- Theories of interacting stacks
- Rough concepts logic
- An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic
- On the recognition of context-free languages
- On multi-valued homomorphisms
- Traces and semiwords
- Deadlock prediction in linear systems
- Propositional dynamic logics with counters and stacks
- Transition graphs semantics and languages
- On the implementation of CSP mechanisms in loglan.