Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)
Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)
Resource Information
The item Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 2125, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in PoznanKornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections:  Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing;  Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming;  Formal Languages: Rewriting Systems, Algebraic Language Theory;  Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds
 Language
 eng
 Extent
 XIV, 498 p.
 Contents

 On word equations and Makanin's algorithm
 Complexity classes with complete problems between P and NPC
 Interpretations of synchronous flowchart schemes
 Generalized Boolean hierarchies and Boolean hierarchies over RP
 The equational logic of iterative processes
 The distributed bit complexity of the ring: From the anonymous to the nonanonymous case
 The jump number problem for biconvex graphs and rectangle covers of rectangular regions
 Recent developments in the design of asynchronous circuits
 New simulations between CRCW PRAMs
 About connections between syntactical and computational complexity
 Completeness in approximation classes
 Separating completely complexity classes related to polynomial size ?Decision trees
 On product hierarchies of automata
 On the communication complexity of planarity
 Contextfree NCE graph grammars
 Dynamic data structures with finite population: A combinatorial analysis
 Iterated deterministic topdown lookahead
 Using generating functions to compute concurrency
 A logic for nondeterministic functional programs extended abstract
 Decision problems and Coxeter groups
 Complexity of formula classes in first order logic with functions
 Normal and sinkless Petri nets
 Descriptive and computational complexity
 The effect of nullchains on the complexity of contact schemes
 MonteCarlo inference and its relations to reliable frequency identification
 Semilinear realtime systolic trellis automata
 Inducibility of the composition of frontiertoroot tree transformations
 On oblivious branching programs of linear length
 Some timespace bounds for onetape deterministic turing machines
 Rank of rational finitely generated Wlanguages
 Extensional properties of sets of time bounded complexity (extended abstract)
 Learning under uniform distribution
 An extended framework for default reasoning
 Logic programming of some mathematical paradoxes
 Analysis of compact 0complete trees: A new access method to large databases
 Representation of recursively enumerable languages using alternating finite tree recognizers
 About a family of binary morphisms which stationary words are Sturmian
 On the finite degree of ambiguity of finite tree automata
 Approximation algorithms for channel assignment in cellular radio networks
 The Borel hierarchy is infinite in the class of regular sets of trees
 Parallel general prefix computations with geometric, algebraic and other applications
 Kolmogorov complexity and Hausdorff dimension
 Tree language problems in pattern recognition theory
 The computational complexity of cellular automata
 On restricted Boolean circuits
 The complexity of connectivity problems on contextfree graph languages
 Constructivity, computability, and computational complexity in analysis
 Isbn
 9783540481805
 Label
 Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings
 Title
 Fundamentals of Computation Theory
 Title remainder
 International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings
 Statement of responsibility
 edited by J. Csirik, J. Demetrovics, F. Gécseg
 Subject

 Computation by Abstract Devices
 Combinatorics
 Computer software
 Computer science
 Computer science
 Logic design
 Algorithm Analysis and Problem Complexity
 Mathematical Logic and Formal Languages
 Computer Science
 Computer Science
 Microprogramming
 Computer software
 Combinatorics
 Microprogramming
 Electronic resources
 Computer software
 Logics and Meanings of Programs
 Logic design
 Computer Science
 Control Structures and Microprogramming
 Computer science
 Language
 eng
 Summary
 This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 2125, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in PoznanKornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections:  Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing;  Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming;  Formal Languages: Rewriting Systems, Algebraic Language Theory;  Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds
 http://library.link/vocab/creatorName
 Csirik, J
 Image bit depth
 0
 LC call number
 QA75.576.95
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Demetrovics, J.
 Gécseg, F.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 380
 http://library.link/vocab/subjectName

 Computer science
 Microprogramming
 Computer software
 Logic design
 Combinatorics
 Computer Science
 Computation by Abstract Devices
 Algorithm Analysis and Problem Complexity
 Logics and Meanings of Programs
 Mathematical Logic and Formal Languages
 Control Structures and Microprogramming
 Combinatorics
 Label
 Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)
 Antecedent source
 mixed
 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
 On word equations and Makanin's algorithm  Complexity classes with complete problems between P and NPC  Interpretations of synchronous flowchart schemes  Generalized Boolean hierarchies and Boolean hierarchies over RP  The equational logic of iterative processes  The distributed bit complexity of the ring: From the anonymous to the nonanonymous case  The jump number problem for biconvex graphs and rectangle covers of rectangular regions  Recent developments in the design of asynchronous circuits  New simulations between CRCW PRAMs  About connections between syntactical and computational complexity  Completeness in approximation classes  Separating completely complexity classes related to polynomial size ?Decision trees  On product hierarchies of automata  On the communication complexity of planarity  Contextfree NCE graph grammars  Dynamic data structures with finite population: A combinatorial analysis  Iterated deterministic topdown lookahead  Using generating functions to compute concurrency  A logic for nondeterministic functional programs extended abstract  Decision problems and Coxeter groups  Complexity of formula classes in first order logic with functions  Normal and sinkless Petri nets  Descriptive and computational complexity  The effect of nullchains on the complexity of contact schemes  MonteCarlo inference and its relations to reliable frequency identification  Semilinear realtime systolic trellis automata  Inducibility of the composition of frontiertoroot tree transformations  On oblivious branching programs of linear length  Some timespace bounds for onetape deterministic turing machines  Rank of rational finitely generated Wlanguages  Extensional properties of sets of time bounded complexity (extended abstract)  Learning under uniform distribution  An extended framework for default reasoning  Logic programming of some mathematical paradoxes  Analysis of compact 0complete trees: A new access method to large databases  Representation of recursively enumerable languages using alternating finite tree recognizers  About a family of binary morphisms which stationary words are Sturmian  On the finite degree of ambiguity of finite tree automata  Approximation algorithms for channel assignment in cellular radio networks  The Borel hierarchy is infinite in the class of regular sets of trees  Parallel general prefix computations with geometric, algebraic and other applications  Kolmogorov complexity and Hausdorff dimension  Tree language problems in pattern recognition theory  The computational complexity of cellular automata  On restricted Boolean circuits  The complexity of connectivity problems on contextfree graph languages  Constructivity, computability, and computational complexity in analysis
 Dimensions
 unknown
 Extent
 XIV, 498 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540481805
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540514988
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540481805
 Label
 Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)
 Antecedent source
 mixed
 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
 On word equations and Makanin's algorithm  Complexity classes with complete problems between P and NPC  Interpretations of synchronous flowchart schemes  Generalized Boolean hierarchies and Boolean hierarchies over RP  The equational logic of iterative processes  The distributed bit complexity of the ring: From the anonymous to the nonanonymous case  The jump number problem for biconvex graphs and rectangle covers of rectangular regions  Recent developments in the design of asynchronous circuits  New simulations between CRCW PRAMs  About connections between syntactical and computational complexity  Completeness in approximation classes  Separating completely complexity classes related to polynomial size ?Decision trees  On product hierarchies of automata  On the communication complexity of planarity  Contextfree NCE graph grammars  Dynamic data structures with finite population: A combinatorial analysis  Iterated deterministic topdown lookahead  Using generating functions to compute concurrency  A logic for nondeterministic functional programs extended abstract  Decision problems and Coxeter groups  Complexity of formula classes in first order logic with functions  Normal and sinkless Petri nets  Descriptive and computational complexity  The effect of nullchains on the complexity of contact schemes  MonteCarlo inference and its relations to reliable frequency identification  Semilinear realtime systolic trellis automata  Inducibility of the composition of frontiertoroot tree transformations  On oblivious branching programs of linear length  Some timespace bounds for onetape deterministic turing machines  Rank of rational finitely generated Wlanguages  Extensional properties of sets of time bounded complexity (extended abstract)  Learning under uniform distribution  An extended framework for default reasoning  Logic programming of some mathematical paradoxes  Analysis of compact 0complete trees: A new access method to large databases  Representation of recursively enumerable languages using alternating finite tree recognizers  About a family of binary morphisms which stationary words are Sturmian  On the finite degree of ambiguity of finite tree automata  Approximation algorithms for channel assignment in cellular radio networks  The Borel hierarchy is infinite in the class of regular sets of trees  Parallel general prefix computations with geometric, algebraic and other applications  Kolmogorov complexity and Hausdorff dimension  Tree language problems in pattern recognition theory  The computational complexity of cellular automata  On restricted Boolean circuits  The complexity of connectivity problems on contextfree graph languages  Constructivity, computability, and computational complexity in analysis
 Dimensions
 unknown
 Extent
 XIV, 498 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540481805
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540514988
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540481805
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Combinatorics
 Computation by Abstract Devices
 Computer Science
 Computer Science
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Control Structures and Microprogramming
 Electronic resources
 Logic design
 Logic design
 Logics and Meanings of Programs
 Mathematical Logic and Formal Languages
 Microprogramming
 Microprogramming
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/FundamentalsofComputationTheory/W58j2q4koRo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/FundamentalsofComputationTheory/W58j2q4koRo/">Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/FundamentalsofComputationTheory/W58j2q4koRo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/FundamentalsofComputationTheory/W58j2q4koRo/">Fundamentals of Computation Theory : International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings, edited by J. Csirik, J. Demetrovics, F. Gécseg, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>