Coverart for item
The Resource Fundamentals of Computation Theory : 10th International Conference, FCT '95 Dresden, Germany, August 22-25, 1995 Proceedings, edited by Horst Reichel

Fundamentals of Computation Theory : 10th International Conference, FCT '95 Dresden, Germany, August 22-25, 1995 Proceedings, edited by Horst Reichel

Label
Fundamentals of Computation Theory : 10th International Conference, FCT '95 Dresden, Germany, August 22-25, 1995 Proceedings
Title
Fundamentals of Computation Theory
Title remainder
10th International Conference, FCT '95 Dresden, Germany, August 22-25, 1995 Proceedings
Statement of responsibility
edited by Horst Reichel
Contributor
Subject
Language
eng
Summary
This book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, computational geometry, systems specification, learning theory, parallelism and concurrency, rewriting and high-level replacement systems, and semantics
Member of
Cataloging source
KIJ
Dewey number
004.0151
Image bit depth
0
Index
no index present
LC call number
QA75.5-76.95
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Reichel, Horst
Series statement
Lecture Notes in Computer Science,
Series volume
965
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Logic design
  • Computer graphics
  • Combinatorial analysis
  • Combinatorial analysis
  • Computer graphics
  • Computer science
  • Computer software
  • Logic design
  • Computer Science
  • Engineering & Applied Sciences
Label
Fundamentals of Computation Theory : 10th International Conference, FCT '95 Dresden, Germany, August 22-25, 1995 Proceedings, edited by Horst Reichel
Instantiates
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Discrete time process algebra with abstraction -- A duration calculus with infinite intervals -- A delegation-based object calculus with subtyping -- Model-checking for real-time systems -- On polynomial ideals, their complexity, and applications -- From a concurrent?-calculus to the?-calculus -- Rewriting regular inequalities -- A simple abstract semantics for equational theories -- Processes with multiple entries and exits -- Efficient rewriting in cograph trace monoids -- Effective category and measure in abstract complexity theory -- About planar cayley graphs -- On condorcet and median points of simple rectilinear polygons -- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs -- r-Domination problems on homogeneously orderable graphs -- Growing patterns in 1D cellular automata -- Petri nets, commutative context-free grammars, and basic parallel processes -- Implementation of a UU-algorithm for primitive recursive tree functions -- Dummy elimination: Making termination easier -- Computing Petri net languages by reductions -- Categorial graphs -- Effective systolic algorithms for gossiping in cycles and two-dimensional grids -- Restarting automata -- Optimal contiguous expression DAG evaluations -- Communication as unification in the Petri Box Calculus -- Distributed catenation and chomsky hierarchy -- The power of frequency computation -- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space -- Properties of probabilistic pushdown automata -- Formal parametric equations -- PRAM's towards realistic parallelism: BRAM's -- Some results concerning two-dimensional turing machines and finite automata -- How hard is to compute the edit distance -- On the synchronization of semi-traces -- Tiling with bars and satisfaction of boolean formulas -- Axiomatizing Petri net concatenable processes -- Functional sorts in data type specifications
Control code
827358340
Dimensions
unknown
Extent
1 online resource
File format
multiple file formats
Form of item
online
Isbn
9783540447702
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-60249-6
Other physical details
volumes: digital.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827358340
Label
Fundamentals of Computation Theory : 10th International Conference, FCT '95 Dresden, Germany, August 22-25, 1995 Proceedings, edited by Horst Reichel
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Discrete time process algebra with abstraction -- A duration calculus with infinite intervals -- A delegation-based object calculus with subtyping -- Model-checking for real-time systems -- On polynomial ideals, their complexity, and applications -- From a concurrent?-calculus to the?-calculus -- Rewriting regular inequalities -- A simple abstract semantics for equational theories -- Processes with multiple entries and exits -- Efficient rewriting in cograph trace monoids -- Effective category and measure in abstract complexity theory -- About planar cayley graphs -- On condorcet and median points of simple rectilinear polygons -- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs -- r-Domination problems on homogeneously orderable graphs -- Growing patterns in 1D cellular automata -- Petri nets, commutative context-free grammars, and basic parallel processes -- Implementation of a UU-algorithm for primitive recursive tree functions -- Dummy elimination: Making termination easier -- Computing Petri net languages by reductions -- Categorial graphs -- Effective systolic algorithms for gossiping in cycles and two-dimensional grids -- Restarting automata -- Optimal contiguous expression DAG evaluations -- Communication as unification in the Petri Box Calculus -- Distributed catenation and chomsky hierarchy -- The power of frequency computation -- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space -- Properties of probabilistic pushdown automata -- Formal parametric equations -- PRAM's towards realistic parallelism: BRAM's -- Some results concerning two-dimensional turing machines and finite automata -- How hard is to compute the edit distance -- On the synchronization of semi-traces -- Tiling with bars and satisfaction of boolean formulas -- Axiomatizing Petri net concatenable processes -- Functional sorts in data type specifications
Control code
827358340
Dimensions
unknown
Extent
1 online resource
File format
multiple file formats
Form of item
online
Isbn
9783540447702
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-60249-6
Other physical details
volumes: digital.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827358340

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...