Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, Languages and Programming [[electronic resource] ] : Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings / / edited by G. Ausiello, C. Böhm
| Automata, Languages and Programming [[electronic resource] ] : Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings / / edited by G. Ausiello, C. Böhm |
| Edizione | [1st ed. 1978.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1978 |
| Descrizione fisica | 1 online resource (X, 510 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computer science Computers Mathematical Logic and Foundations Computer Science, general Theory of Computation |
| ISBN | 3-540-35807-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simple EOL forms under uniform interpretation generating CF languages -- Codes : Unequal probabilities, unequal letter costs -- Sur l'inversion des morphismes d'arbres -- Grammars with dynamic control sets -- Ambiguite forte -- Relationship between density and deterministic complexity of MP-complete languages -- Stable models of typed ?-calculi -- Path measures of turing machine computations -- Une famille remarquable de codes indecomposables -- Comparisons and reset machines -- Size — Depth tradeoff in boolean formulas -- (Semi)-separability of finite sets of terms in Scott's D?-models of the ?-calculus -- Mutual exclusion of N processors using an O(N)-valued message variable -- On the power of self-application and higher type recursion -- Time and space bounds for selection problems -- Stepwise specification and implementation of abstract data types -- The complexity of equivalence and containment for free single variable program schemes -- On improving the worst case running time of the Boyer-Moore string matching algorithm -- Semantics and correctness of nondeterministic flowchart programs with recursive procedures -- Arithmetical completeness in logics of programs -- Covering a graph by circuits -- A pspace complete problem related to a pebble game -- Some effective results about linear recursive sequences -- On the parsing and covering of simple chain grammars -- Sur un cas particulier de la conjecture de Cerny -- States can sometimes do more than stack symbols in PDA's -- Some decision results for recognizable sets in arbitrary monoids -- Sur les series rationnelles en variables non commutatives -- On constructing efficient evaluators for attribute grammars -- Une extension de la theorie des types en ?-calcul -- Parallel and nondeterministic time complexity classes -- Multiterminal network flow and connectivity in unsymmetrical networks -- Admissible coherent c.p.o.'s -- Integration of the phase-difference relations in asynchronous sequential networks -- Self-modifying nets, a natural extension of Petri nets -- Head recurrent terms in combinatory logic : A generalization of the notion of head normal form -- Characterization problems in the theory of inductive inference. |
| Record Nr. | UNISA-996465306403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1978 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CAAP '81 [[electronic resource] ] : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings / / edited by E. Astesiano, C. Böhm
| CAAP '81 [[electronic resource] ] : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings / / edited by E. Astesiano, C. Böhm |
| Edizione | [1st ed. 1981.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 |
| Descrizione fisica | 1 online resource (VI, 365 p.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematics
Algorithms Computers Mathematics, general Algorithm Analysis and Problem Complexity Theory of Computation |
| ISBN | 3-540-38716-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and the nonlinearity -- Grammars without erasing rules. the OI case -- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes -- Certain algorithms for subgraph isomorphism problems -- A # P-complete problem over arithmetical trees -- Trees in Kripke models and in an intuitionistic refutation system -- Efficient optimization of monotonic functions on trees -- Differents types de derivations infinies dans les grammaires algebriques d'arbres -- Discriminability of infinite sets of terms in the D?-models of the ?-calculus. |
| Record Nr. | UNISA-996465508003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
λ-Calculus and Computer Science Theory [[electronic resource] ] : Proceedings of the Symposium Held in Rome March 25–27, 1975. IAC - CNR Istituto per le Applicazioni del Calcolo “Mauro Picone” of the Consiglio Nazionale delle Ricerche / / edited by C. Böhm
| λ-Calculus and Computer Science Theory [[electronic resource] ] : Proceedings of the Symposium Held in Rome March 25–27, 1975. IAC - CNR Istituto per le Applicazioni del Calcolo “Mauro Picone” of the Consiglio Nazionale delle Ricerche / / edited by C. Böhm |
| Edizione | [1st ed. 1975.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1975 |
| Descrizione fisica | 1 online resource (XII, 371 p. 1 illus.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-37944-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinators and classes -- Least fixed points revisited -- Infinite normal forms for the ?-calculus -- A survey of some useful partial order relations on terms of the lambda calculus -- ?-Terms as total or partial functions on normal forms -- Continuous semantics and inside-out reductions -- An algebraic interpretation of the ??K-calculus and a labelled ?-calculus -- Les modeles informatiques des ?-calculs -- On the description of time varying systems in ?-calculus -- Unification in typed lambda calculus -- A condition for identifying two elements of whatever model of combinatory logic -- Typed meaning in Scott's ?-calculus models -- Programming language semantics in a typed lambda-calculus -- Big trees in a ?-calculus with ?-expressions as types -- Normed uniformly reflexive structures -- A model with nondeterministic computation -- On subrecursiveness in weak combinatory logic -- Sequentially and parallelly computable functionals -- Computation on arbitrary algebras -- On solvability by ?I-terms -- Some philosophical issues concerning theories of combinators -- Open problems. |
| Record Nr. | UNISA-996465403903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1975 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||