Fundamentals of Computation Theory (Record no. 188961)

MARC details
000 -LEADER
fixed length control field 05571nam a22005775i 4500
001 - CONTROL NUMBER
control field 978-3-540-48321-2
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423132538.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s1999 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540483212
-- 978-3-540-48321-2
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-48321-7
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Fundamentals of Computation Theory
Medium [electronic resource] :
Remainder of title 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings /
Statement of responsibility, etc edited by Gabriel Ciobanu, Gheorghe Paun.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 1999.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 1999.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 576 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume number/sequential designation 1684
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Randomized complexity of linear arrangements and polyhedra? -- Tile transition systems as structured coalgebras? -- Caesar and DNA — views on cryptology -- Automata and their interaction: Definitional suggestions -- Axiomatising asynchronous process calculi -- A polynomial time approximation scheme for dense MupIN 2S{upAT} -- Decidable classes of the verification problem in a timed predicate logic -- Interpretations of extensible objects and types -- Restrictive acceptance suffices for equivalence problems -- Grammar systems as language analyzers and recursively enumerable languages -- An interpretation of extensible objects -- Modeling operating systems schedulers with multi-stack-queue grammars -- Iterative arrays with a wee bit alternation -- Secret sharing schemes with detection of cheaters for a general access structure -- Constructive notes on uniform and locally convex spaces -- Graph automorphisms with maximal projection distances -- Kleene theorems for event-clock automata -- Strong iteration lemmata for regular, linear, context-free, and linear indexed languages -- Exponential output size of top-down tree transducers -- On recognizable languages in divisibility monoids -- Expressiveness of point-to-point versus broadcast communications -- On relative loss bounds in generalized linear regression -- Generalized P-systems -- Optimal, distributed decision-making: The case of no communication -- Generalized PCP is decidable for marked morphisms -- On time-constructible functions in one-dimensional cellular automata -- Dichotomy theorem for the generalized unique satisfiability problem -- A general categorical connection between local event structures and local traces -- Correct translation of mutually recursive function systems into TOL collage grammars -- Synchronized product of linearbounded machines -- On maximal repetitions in words -- Axiomatization of the coherence property for categories of symmetries -- Sewing grammars -- State and transition complexity of Watson-Crick finite automata -- A confluence result for a typed ?-calculus of exception handling with fixed-point -- ?-Uniformly decidable sets and turing machines -- A parallel context-free derivation hierarchy -- Generalized synchronization languages -- A generalization of Dijkstra’s calculus to typed program specifications -- Homomorphisms and concurrent term rewriting -- On two-sided infinite fixed points of morphisms -- Tiling multi-dimensional arrays -- Modeling interaction by sheaves and geometric logic -- The operators minCh and maxCh on the polynomial hierarchy -- The Kolmogorov complexity of real numbers -- A partial order method for the verification of time Petri nets -- Deriving formulas for domination numbers of fasciagraphs and rotagraphs.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT '99, held in Iasi, Romania in August/September 1999. The 42 revised full papers presented together with four invited papers were carefully selected from a total of 102 submissions. Among the topics addressed are abstract data types, algorithms and data structures, automata and formal languages, categorical and topological approaches, complexity, computational geometry, concurrency, cryptology, distributed computing, logics in computer science, process algebras, symbolic computation, molecular computing, quantum computing, etc.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ciobanu, Gabriel.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Paun, Gheorghe.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540664123
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783662176634
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 1611-3349 ;
Volume number/sequential designation 1684
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/3-540-48321-7">https://doi.org/10.1007/3-540-48321-7</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in