Description |
1 online resource (xi, 606 pages) |
Series |
Lecture notes in computer science ; 45 |
|
Lecture notes in computer science ; 45.
|
Contents |
Exercises in denotational semantics / K.R. Apt and J.W. de Bakker -- W-automata and their languages / W. Brauer -- On semantic issues in the relational model of data / J-M. Cadiou -- The effective arrangement of logical systems / E.W. Dijkstra -- Recursivity, sequence recursivity, stack recursivity and semantics of programs / G. Germano and A. Maggiolo-Schettini -- Descriptional complexity (of languages)--a short survey / J. Gruska -- On the branching structure of languages / I.M. Havel -- Algorithms and real numbers / N.M. Nagorny -- On mappings of machines / M. Novotny -- Recent results on L systems / A. Salomaa -- Decision problems for multi-tape automata / B.A. Trakhtenbrot -- Some fundamentals of order-algebraic semantics / E.G. Wagner, J.B. Wright, J.A. Goguen, and J.W. Thatcher -- On attribute grammars / V.N. Agafonov -- Formal definition of semantics of generalized control regimes / L. Aiello, M. Aiello, G. Attardi, P. Cavallari, and G. Prini -- Minimal while programs / E.S. Bainbridge -- On specific features of recognizable families of languages / V. Benda and K. Kendová -- On the termination of simple computer programs / E. Bergmann -- Reduction of petri-nets / G. Berthelot and G. Roucairol -- On behaviour of r-fuzzy automata / J. Brunner and W. Wechler -- Cannonizing reducibility method in the theory of program schemata / A.O. Buda -- Strongly connected G-S-M mappings preserving conjugation / C. Choffrut -- Analysis of the non-context-free component of formal languages / M.P. Chytil -- Programs, computations and temporal features / M. Colombetti and E. Pagello -- A note on the automatic generation of inductive assertions / W. Coy -- On the relationship between a procedure and its data / A. Cremers and Th. N. Hibbard -- On the relativization of deterministic and nondeterministic complexity classes / M.I. Dekhtyar -- The metric properties on the semigroups and the languages / A. Dinca -- A lower bound of 1/2n² on linear search programs for the knapsack problem / D. Dobkin and R.J. LIpton -- The direct product of automata and quasi-automata / W. Dörfler -- An axiomatic approach to information structures / H.-D. Ehrich -- Parallelism of manipulations in multidimensional information structures / H. Ehrig and H.-J. Kreowski -- On strict interpretations of grammar forms / S. Ginsburg and O. Mayer -- A hierarchy of context-sensitive languages / I. Gorun -- On consecutive storage of records / J. Górski -- A remark on equivalence of Mazurkiewicz's finite-control algorithms over nets / M. Grabowski -- Microprogram-oriented model of the controlled structure / I. Hansen and J. Leszczyłowski -- Relations between programs with different storage requirements / M.D. Harrison -- An algebraic approach to data types, program verification, and program synthesis / F.W. von Henke -- About three equational classes of languages built up by shuffle operations / M. Höpner and M. Opp -- A machine independent description of complexity classes, definable by nondeterministic as well as deterministic Turing machines with primitive recursive tape or time bounds / H. Huwig -- Schemes with recursion on higher types / K. Indermark -- Constructing iterative version of a system of recursive procedures / J. Irlik -- A method using a set-theoretical formalism to describe the semantics of programming languages / W. Issel -- The cubic search methods / R. Jagielski -- Vectors of coroutines / R. Janicki -- One-one degrees of Turing machines decision problems / J. Jedrzejowicz -- Heuristic representation of state-space by finite automaton / J. Kelemen -- Semigroup characterizations of some language varieties / R. Knast -- On memory requirements of Strassen's algorithms / A. Kreczmar -- Determinism in concurrent systems / W. Kwasowiec -- Generating control mechanisms by restrictions / K. Lautenbach and H. Wedde -- On diagnosis of algorithmical processes / J.W. Łaski -- On some properties of cyclic automata and their extensions / B. Mikołajczak -- Compiler generation using denotational semantics / P.D. Mosses -- On divergence problem for program schemas / V.A. Nepomniaschy -- On the parsing of LL-regular grammars / A. Nijholt -- The characteristic polynomial of a finite automaton / D. Perrin -- Error detection using regular languages / P. Prusinkiewicz -- On a relationship between programs of address machines and Mazurkiewicz algorithms / Z. Raś -- Dijkstra's predicate transformer, non-determinism, recursion, and termination / W.P. de Roever -- Context-free programmed grammars and ETOL systems / G. Rozenberg and D. Vermeir -- Context-free algebra: a mathematical device for compiler specification / T. Rus -- On the lower bound for minimum comparison selection / P. Ružiča and J. Wiedermann -- Computational processes generated by programs with recursive procedures and block structures / A. Salwicki and T. Müldner -- An algebraic framework for the study of the syntactic monoids-application to the group languages / J. Sakarovitch -- Degrees of parallelism in computations / V. Yu. Sazonav -- On adaptability of a system of programs / A. Schurmann -- A mathematical model of parallel information processing / A. Skowron -- Powerdomains / M.B. Smyth -- On the domain of iteration in iterative algebraic theories / J. Tiuryn -- The influence of the data presentation on the computational power of machines / R. Verbeek and K. Weihrauch -- On sequential modelling of non-sequential processes / J. Winkowski -- Equivalence and optimization of recursive program schemata / Z. Zwinogrodzki -- Observability concepts in abstract data type specification / V. Giarratana, F. Gimona, and U. Montanari -- The calculus of facts / H.J. Genrich and G. Thieler-Mevissen -- Multiplicity functions on w-automata / M. Karpiński |
Analysis |
Formal languages Congresses |
|
Machine theory Congresses |
|
Programming (Electronic computers) Congresses |
Notes |
"The Symposium is being organized by the Computation Centre of the Polish Academy of Sciences in cooperation with the University of Gdańsk." |
Bibliography |
Includes bibliographical references and index |
Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
digitized 2013 HathiTrust Digital Library committed to preserve pda MiAaHDL |
|
Print version record |
Subject |
Formal languages -- Congresses
|
|
Machine theory -- Congresses
|
|
Computer programming -- Congresses
|
|
Computer programming
|
|
Formal languages
|
|
Machine theory
|
|
Fundamentele informatica.
|
|
Langages formels -- Congrès.
|
|
Ordinateurs -- Programmation -- Congrès.
|
|
Automates mathématiques, Théorie des -- Congrès.
|
Genre/Form |
Conference papers and proceedings
|
|
Congressen (vorm)
|
Form |
Electronic book
|
Author |
Mazurkiewicz, Antoni.
|
|
Polska Akademia Nauk. Centrum Obliczeniowe.
|
|
Uniwersytet Gdański.
|
ISBN |
9783540381693 |
|
3540381694 |
|