close
1.

図書

図書
Mogens Nielsen, Uffe Engberg (eds.)
出版情報: Berlin : Springer, c2002  xiii, 433 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2303
所蔵情報: loading…
2.

図書

図書
Hartmut Schmeck, Theo Ungerer, Lars Wolf (eds.)
出版情報: Berlin : Springer, c2002  xiv, 286 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2299
所蔵情報: loading…
目次情報: 続きを見る
Invited Program
Keynote Communicating Cars: A Case for Ubiquitous Computing in the Automotive Domain / Ralf Guido Herrtwich
Keynote Microprocessor Architectures for the Mobile Internet Era / Marc Fleischmann
Context-Aware Systems / I:
An Architecture for the Integration of Physical and Informational Spaces / Scott M. Thayer ; Peter Steenkiste
A Context System for a Mobile Service Platform / Fritz Hohl ; Lars Mehrmann ; Amen Hamdan
Detecting Context in Distributed Sensor Networks by Using Smart Context-Aware Packets / Florian Michahelles ; Michael Samulowitz ; Bernt Schiele
System Aspects / II:
A Ubiquitous Control Architecture for Low Power Systems / James ôWezö Weatherall ; Duncan Grisby
Software Architecture-Based Adaptation for Pervasive Systems / Shang-Wen Cheng ; David Garlan ; Bradley Schmerl ; Joao Pedro Sousa ; Bridget Spitznagel ; Ningning Hu
KECho - Event Communication for Distributed Kernel Services / Christian Poellabauer ; Karsten Schwan ; Greg Eisenhauer ; Jiantao Kong
Networking 1 / III:
A Fine-Grained Addressing Concept for GeoCast / Peter Coschurba ; Kurt Rothermel ; Frank Durr
Data Paths in Wearable Communication Networks / Christian Decker ; Michael Beigl
Location and Network Quality Issues in Local Area Wireless Networks / Georgi Tonev ; Vaidy Sunderam ; Roger Loader ; James Pascoe
Processor Architecture / IV:
Design Tradeoffs for Embedded Network Processors / Tilman Wolf ; Mark A. Franklin
Reconfigurable RISC - A New Approach for Space-Efficient Superscalar Microprocessor Architecture / Sascha Wennekers ; Christian Siemers
Cached Two-Level Adaptive Branch Predictors with Multiple Stages / Colin Egan ; Gordon Steven ; Lucian Vintan
Middleware and Verification / V:
On the Combination of Assertions and Virtual Prototyping for the Design of Safety-Critical Systems / Tim Oodes ; Holger Krisp ; Christian Muller-Schloer
Ubiquitous Access to Wide-Area High-Performance Computing / Frank Burchert ; Stephan Gatzka ; Christian Hochberger ; Chang-Kun Lee ; Ulrike Lucke ; Djamshid Tavangarian
Filter Similarities in Content-Based Publish/Subscribe Systems / Gero Muhl ; Ludger Fiege ; Alejandro Buchmann
Networking 2 / VI:
A Bluetooth Remote Control System / Fridtjof Feldbusch ; Alexander Paar ; Manuel Odendahl ; Ivan Ivanov
Rendezvous Layer Protocols for Bluetooth-Enabled Smart Devices / Frank Siegemund ; Michael Rohs
A Robust Header Compression Simulator & Visualizer / Xiaoyuan Gu ; Hannes Hartenstein ; Stefan Fischer
Author Index
Invited Program
Keynote Communicating Cars: A Case for Ubiquitous Computing in the Automotive Domain / Ralf Guido Herrtwich
Keynote Microprocessor Architectures for the Mobile Internet Era / Marc Fleischmann
3.

図書

図書
Daniel Le Métayer (ed.)
出版情報: Berlin : Springer, c2002  xii, 329 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2305
所蔵情報: loading…
4.

図書

図書
R. Nigel Horspool (ed.)
出版情報: Berlin : Springer, c2002  xi, 341 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2304
所蔵情報: loading…
目次情報: 続きを見る
Tool Demonstrations
LISA: An Interactive Environment for Programming Language Development / Marjan Mernik ; Mitja Lenič ; Enis AvdičauÜević ; Viljem Äumer
Building an Interpreter with Vmgen / M. Anton Ertl ; David Gregg
Compiler Construction Using LOTOS NT / Hubert Garavel ; Frédéric Lang ; Radu Mateescu
Analysis and Optimization
Data Compression Transformations for Dynamically Allocated Data Structures / Youtao Zhang ; Rajiv Gupta
Evaluating a Demand Driven Technique for Call Graph Construction / Gagan Agrawal ; Jinqian Li ; Qi Su
A Graph-Free Approach to Data-Flow Analysis / Markus Mohnen
A Representation for Bit Section Based Analysis and Optimization / Eduard Mehofer
Low-Level Analysis
Online Subpath Profiling / David Oren ; Yossi Matias ; Mooly Sagiv
Precise Exception Semantics in Dynamic Compilation / Michael Gschwind ; Erik Altman
Decompiling Java Bytecode: Problems, Traps and Pitfalls / Jerome Miecznikowski ; Laurie Hendren
Grammars and Parsing
Forwarding in Attribute Grammars for Modular Language Design / Eric Van Wyk ; Oege de Moor ; Kevin Backhouse ; Paul Kwiatkowski
Disambiguation Filters for Scannerless Generalized LR Parsers / Mark G. J. van den Brand ; Jeroen Scheerder ; Jurgen J. Vinju ; Eelco Visser
Invited Talk
Modular Static Program Analysis / Patrick Cousot ; Radhia Cousot
Domain-Specific Languages and Tools
StreamIt: A Language for Streaming Applications / William Thies ; Michal Karczmarek ; Saman Amarasinghe
Compiling Mercury to High-Level C Code / Fergus Henderson ; Zoltan Somogyi
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs / George C. Necula ; Scott McPeak ; Shree P. Rahul ; Westley Weimer
Energy Consumption Optimizations
Linear Scan Register Allocation in the Context of SSA Form and Register Constraints / Hanspeter Mössenböck ; Michael Pfeiffer
Global Variable Promotion: Using Registers to Reduce Cache Power Dissipation / Andrea G. M. Cilio ; Henk Corporaal
Optimizing Static Power Dissipation by Functional Units in Superscalar Processors / Siddharth Rele ; Santosh Pande ; Soner Onder
Influence of Loop Optimizations on Energy Consumption of Multi-bank Memory Systems / Mahmut Kandemir ; Ibrahim Kolcu ; Ismail Kadayif
Loop and Array Optimizations
Effective Enhancement of Loop Versioning in Java / Vitaly V. Mikheev ; Stanislav A. Fedoseev ; Vladimir V. Sukharev ; Nikita V. Lipsky
Value-Profile Guided Stride Prefetching for Irregular Code / Youfeng Wu ; Mauricio Serrano ; Rakesh Krishnaiyer ; Wei Li ; Jesse Fang
A Comprehensive Approach to Array Bounds Check Elimination for Java / Feng Qian ; Clark Verbrugge
Author Index
Tool Demonstrations
LISA: An Interactive Environment for Programming Language Development / Marjan Mernik ; Mitja Lenič ; Enis AvdičauÜević ; Viljem Äumer
Building an Interpreter with Vmgen / M. Anton Ertl ; David Gregg
5.

図書

図書
Fabio Crestani, Mark Girolami, Cornelis Joost van Rijsbergen (eds.)
出版情報: Berlin : Springer, c2002  xiii, 362 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2291
所蔵情報: loading…
目次情報: 続きを見る
Multimedia
Evaluating a Melody Extraction Engine / Thomas Sødring ; Alan F. Smeaton
Organising and Searching Partially Indexed Image Databases / Gérald Duffing ; Malika Smaïl
Combining Features for Content-Based Sketch Retrieval - A Comparative
Evaluation of Retrieval Performance / Daniel Heesch ; Stefan Rüger
The Web
Combining Web Document Representations in a Bayesian Inference
Network Model Using Link and Content-Based Evidence / Theodora Tsikrika ; Mounia Lalmas
An Improved Computation of the PageRank Algorithm / Sung Jin Kim ; Sang Ho Lee
Serving Enhanced Hypermedia Information / George Lepouras ; Costas Vassilakis ; George R.S. Weir
Query Modification
The Use of Implicit Evidence for Relevance Feedback in Web Retrieval / Ryen W. White ; Ian Ruthven ; Joemon M. Jose
Subject Knowledge, Source of Terms, and Term Selection in Query
Expansion: An Analytical Study / Pertti Vakkari
Automatic Profile Reformulation Using a Local Document Analysis / Anis Benammar ; Gilles Hubert ; Josiane Mothe
Soft Computing
A Study on Using Genetic Niching for Query Optimisation in
Document Retrieval / Mohand Boughanem ; Lynda Tamine
Concept Based Adaptive IR Model Using FCA-BAM Combination for
Concept Representation and Encoding / R.K. Rajapakse ; M. Denham
Models
A Layered Bayesian Network Model for Document Retrieval / Luis M. de Campos ; Juan M. Fernández-Luna ; Juan F. Huete
Term Frequency Normalization via Pareto Distributions / Gianni Amati ; Cornelis Joost van Rijsbergen
Optimal Mixture Models in IR / Victor Lavrenko
Categorization
Text Categorization: An Experiment Using Phrases / Madhusudhan Kongovi ; Juan Carlos Guzman ; Venu Dasigi
A Hierarchical Model for Clustering and Categorising Documents / E. Gaussier ; C. Goutte ; K. Popat ; F. Chen
Uncertainty-Based Noise Reduction and Term Selection in
Text Categorization / C. Peters ; C.H.A. Koster
Structured Documents
A Graphical User Interface for Structured Document Retrieval / Jesus Vegas ; Pablo de la Fuente ; Fabio Crestani
The Accessibility Dimension for Structured Document Retrieval / Thomas Roelleke ; Gabriella Kazai ; Stefan Quicker
Cross-Language
Building Bilingual Dictionaries from Parallel Web Documents / Craig J.A. McEwan ; Iadh Ounis
Translation-Based Indexing for Cross-Language Retrieval / Douglas W. Oard ; Funda Ertunc
Interactive Systems
A Retrospective Evaluation Method for Exact-Match and Best-Match
Queries Applying an Interactive Query Performance Analyser / Eero Sormunen
Genre Classification and Domain Transfer for Information Filtering / Aidan Finn ; Nicholas Kushmerick ; Barry Smyth
Author Index
Multimedia
Evaluating a Melody Extraction Engine / Thomas Sødring ; Alan F. Smeaton
Organising and Searching Partially Indexed Image Databases / Gérald Duffing ; Malika Smaïl
6.

図書

図書
Gregory D. Hager ...[et al.] (eds.)
出版情報: Berlin : Springer, c2002  viii, 373 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2238
所蔵情報: loading…
7.

図書

図書
Christian Schulte
出版情報: Berlin : Springer, c2002  xii, 176 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2302 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1:
Constraint Programming / 1.1:
Motivation / 1.2:
Approach / 1.3:
Outline / 1.4:
Source Material / 1.5:
Constraints / 2:
Search / 2.2:
Programming / 2.3:
Introducing Oz Light / 3:
Overview / 3.1:
Oz Light: Basics / 3.2:
The Store / 3.2.1:
Threads / 3.2.2:
Statements / 3.2.3:
Oz Light Continued / 3.3:
Primitive Operations / 3.3.1:
Exceptions / 3.3.2:
Ports and Active Services / 3.3.3:
Finite Domain Constraints / 3.3.4:
Syntactic Convenience / 3.4:
Relation to Full Oz / 3.5:
Spaces for Search / 4:
Local Computation Spaces / 4.1:
Space Manipulation / 4.3:
Space Creation / 4.3.1:
Merging Spaces / 4.3.2:
Injecting into Spaces / 4.3.3:
Control and Status / 4.4:
Alternatives / 4.5:
Distributable Spaces / 4.5.2:
Synchronizing on Stability / 4.5.3:
Committing to Alternatives / 4.5.4:
Cloning Spaces / 4.5.5:
Refining Commit / 4.5.6:
Situated Procedure Calls: Services Reconsidered / 4.6:
Previous Work: Solve Combinator / 4.7:
Summary / 4.8:
Search Engines / 5:
Depth-First Search / 5.1:
Simplifying Control: Exceptions / 5.2:
Binarization / 5.3:
Multiple Solutions / 5.4:
Explicit State Representation / 5.5:
Limited Discrepancy Search / 5.6:
Best-First Search / 5.7:
Best-Solution Search / 6:
Constraining Spaces / 6.1:
Iterative Best-Solution Search / 6.2:
Branch-and-Bound Best-Solution Search / 6.3:
An Alternative Formulation of BAB / 6.4:
Prune-Search: Generalizing BAB / 6.5:
Recomputation / 7:
Full Recomputation / 7.1:
Fixed Recomputation / 7.3:
Why Recomputation Matters / 7.4:
Adaptive Recomputation / 7.5:
Oz Explorer: Visual Search / 8:
Development of Constraint Programs / 8.1:
Example: Aligning for a Photo / 8.2:
Features / 8.3:
Implementation / 8.4:
Evaluation / 8.5:
Related Work / 8.6:
Distributed Search / 9:
Distributed Oz / 9.1:
Architecture / 9.3:
Cooperation / 9.3.1:
Worker / 9.3.2:
Manager / 9.3.3:
Distributed Search Engines / 9.3.4:
Spaces for Combinators / 9.5:
Space Tree / 10.1:
Space Tree Manipulation / 10.3:
Stability / 10.3.1:
Status Variable / 10.4.2:
Debugging Support / 10.4.3:
Choice of Programming Language / 10.5:
Constraint Combinators / 11:
Concurrent Negation / 11.1:
Generic Reification / 11.3:
Disjunction / 11.4:
Conditional / 11.5:
Andorra-Style Disjunction / 11.6:
Discussion and Evaluation / 11.7:
Implementing Oz Light / 12:
Synchronization / 12.1:
Store / 12.3:
Scheduler / 12.4:
Implementing Spaces / 13:
Nodes and Links / 13.1:
The Store: Model / 13.2.2:
The Store: Implementation / 13.2.4:
Runnable Threads / 13.3:
Globally Suspended Threads / 13.3.2:
Speculative Constraints / 13.3.3:
Local Threads / 13.3.4:
Checking Stability / 13.3.5:
Merge / 13.4:
Choose and Commit / 13.5:
Richer Basic Constraints / 13.5.2:
Variable Aliasing / 13.6.1:
Tree Constraints / 13.6.2:
Ports / 13.6.3:
Performance Overview / 13.8:
Other Approaches to Search / 14:
Other Constraint Programming Systems / 14.1:
Comparison with Trailing / 14.2:
Expressiveness / 14.2.1:
Implementation Issues / 14.2.2:
Criteria and Examples / 14.2.3:
Copying / 14.2.4:
Copying versus Trailing / 14.2.5:
Recomputation versus Trailing / 14.2.6:
System Comparison / 14.3:
Conclusion / 15:
Main Contributions / 15.1:
Future Work / 15.2:
Benchmark Problems and Platforms / A:
Benchmark Problems / A.1:
Sequential Platform / A.2:
Distributed Platform / A.3:
References
Index
Introduction / 1:
Constraint Programming / 1.1:
Motivation / 1.2:
8.

図書

図書
Barbara Dunin-Kȩplicz, Edward Nawarecki (eds.)
出版情報: Berlin : Springer, c2002  ix, 340 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2296 . Lecture notes in artificial intelligence
所蔵情報: loading…
9.

図書

図書
Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
出版情報: Berlin : Springer, c2002  xiii, 218 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2283
所蔵情報: loading…
目次情報: 続きを見る
Elementary Techniques / Part I:
The Basics / 1:
Introduction / 1.1:
Theories / 1.2:
Types, Terms, and Formulae / 1.3:
Variables / 1.4:
Interaction and Interfaces / 1.5:
Getting Started / 1.6:
Functional Programming in HOL / 2:
An Introductory Theory / 2.1:
An Introductory Proof / 2.2:
Some Helpful Commands / 2.3:
Datatypes / 2.4:
Lists / 2.4.1:
The General Format / 2.4.2:
Primitive Recursion / 2.4.3:
Case Expressions / 2.4.4:
Structural Induction and Case Distinction / 2.4.5:
Case Study: Boolean Expressions / 2.4.6:
Some Basic Types / 2.5:
Natural Numbers / 2.5.1:
Pairs / 2.5.2:
Datatype option / 2.5.3:
Definitions / 2.6:
Type Synonyms / 2.6.1:
Constant Definitions / 2.6.2:
The Definitional Approach / 2.7:
More Functional Programming / 3:
Simplification / 3.1:
What Is Simplification? / 3.1.1:
Simplification Rules / 3.1.2:
The simp Method / 3.1.3:
Adding and Deleting Simplification Rules / 3.1.4:
Assumptions / 3.1.5:
Rewriting with Definitions / 3.1.6:
Simplifying let-Expressions / 3.1.7:
Conditional Simplification Rules / 3.1.8:
Automatic Case Splits / 3.1.9:
Tracing / 3.1.10:
Induction Heuristics / 3.2:
Case Study: Compiling Expressions / 3.3:
Advanced Datatypes / 3.4:
Mutual Recursion / 3.4.1:
Nested Recursion / 3.4.2:
The Limits of Nested Recursion / 3.4.3:
Case Study: Tries / 3.4.4:
Total Recursive Functions / 3.5:
Defining Recursive Functions / 3.5.1:
Proving Termination / 3.5.2:
Simplification and Recursive Functions / 3.5.3:
Induction and Recursive Functions / 3.5.4:
Presenting Theories / 4:
Concrete Syntax / 4.1:
Infix Annotations / 4.1.1:
Mathematical Symbols / 4.1.2:
Prefix Annotations / 4.1.3:
Syntax Translations / 4.1.4:
Document Preparation / 4.2:
Isabelle Sessions / 4.2.1:
Structure Markup / 4.2.2:
Formal Comments and Antiquotations / 4.2.3:
Interpretation of Symbols / 4.2.4:
Suppressing Output / 4.2.5:
Logic and Sets / Part II:
The Rules of the Game / 5:
Natural Deduction / 5.1:
Introduction Rules / 5.2:
Elimination Rules / 5.3:
Destruction Rules: Some Examples / 5.4:
Implication / 5.5:
Negation / 5.6:
Interlude: The Basic Methods for Rules / 5.7:
Unification and Substitution / 5.8:
Substitution and the subst Method / 5.8.1:
Unification and Its Pitfalls / 5.8.2:
Quantifiers / 5.9:
The Universal Introduction Rule / 5.9.1:
The Universal Elimination Rule / 5.9.2:
The Existential Quantifier / 5.9.3:
Renaming an Assumption: rename_tac / 5.9.4:
Reusing an Assumption: frule / 5.9.5:
Instantiating a Quantifier Explicitly / 5.9.6:
Description Operators / 5.10:
Definite Descriptions / 5.10.1:
Indefinite Descriptions / 5.10.2:
Some Proofs That Fail / 5.11:
Proving Theorems Using the blast Method / 5.12:
Other Classical Reasoning Methods / 5.13:
Forward Proof: Transforming Theorems / 5.14:
Modifying a Theorem Using of and THEN / 5.14.1:
Modifying a Theorem Using OF / 5.14.2:
Forward Reasoning in a Backward Proof / 5.15:
The Method insert / 5.15.1:
The Method subgoal_tac / 5.15.2:
Managing Large Proofs / 5.16:
Tacticals, or Control Structures / 5.16.1:
Subgoal Numbering / 5.16.2:
Proving the Correctness of Euclid's Algorithm / 5.17:
Sets, Functions, and Relations / 6:
Sets / 6.1:
Finite Set Notation / 6.1.1:
Set Comprehension / 6.1.2:
Binding Operators / 6.1.3:
Finiteness and Cardinality / 6.1.4:
Functions / 6.2:
Function Basics / 6.2.1:
Injections, Surjections, Bijections / 6.2.2:
Function Image / 6.2.3:
Relations / 6.3:
Relation Basics / 6.3.1:
The Reflexive and Transitive Closure / 6.3.2:
A Sample Proof / 6.3.3:
Well-Founded Relations and Induction / 6.4:
Fixed Point Operators / 6.5:
Case Study: Verified Model Checking / 6.6:
Propositional Dynamic Logic - PDL / 6.6.1:
Computation Tree Logic - CTL / 6.6.2:
Inductively Defined Sets / 7:
The Set of Even Numbers / 7.1:
Making an Inductive Definition / 7.1.1:
Using Introduction Rules / 7.1.2:
Rule Induction / 7.1.3:
Generalization and Rule Induction / 7.1.4:
Rule Inversion / 7.1.5:
Mutually Inductive Definitions / 7.1.6:
The Reflexive Transitive Closure / 7.2:
Advanced Inductive Definitions / 7.3:
Universal Quantifiers in Introduction Rules / 7.3.1:
Alternative Definition Using a Monotone Function / 7.3.2:
A Proof of Equivalence / 7.3.3:
Another Example of Rule Inversion / 7.3.4:
Case Study: A Context Free Grammar / 7.4:
Advanced Material / Part III:
More about Types / 8:
Numbers / 8.1:
Numeric Literals / 8.1.1:
The Type of Natural Numbers, nat / 8.1.2:
The Type of Integers, int / 8.1.3:
The Type of Real Numbers, real / 8.1.4:
Pairs and Tuples / 8.2:
Pattern Matching with Tuples / 8.2.1:
Theorem Proving / 8.2.2:
Records / 8.3:
Record Basics / 8.3.1:
Extensible Records and Generic Operations / 8.3.2:
Record Equality / 8.3.3:
Extending and Truncating Records / 8.3.4:
Axiomatic Type Classes / 8.4:
Overloading / 8.4.1:
Axioms / 8.4.2:
Introducing New Types / 8.5:
Declaring New Types / 8.5.1:
Defining New Types / 8.5.2:
Advanced Simplification, Recursion, and Induction / 9:
Advanced Features / 9.1:
How the Simplifier Works / 9.1.2:
Advanced Forms of Recursion / 9.2:
Beyond Measure / 9.2.1:
Recursion over Nested Datatypes / 9.2.2:
Partial Functions / 9.2.3:
Advanced Induction Techniques / 9.3:
Massaging the Proposition / 9.3.1:
Beyond Structural and Recursion Induction / 9.3.2:
Derivation of New Induction Schemas / 9.3.3:
CTL Revisited / 9.3.4:
Case Study: Verifying a Security Protocol / 10:
The Needham-Schroeder Public-Key Protocol / 10.1:
Agents and Messages / 10.2:
Modelling the Adversary / 10.3:
Event Traces / 10.4:
Modelling the Protocol / 10.5:
Proving Elementary Properties / 10.6:
Proving Secrecy Theorems / 10.7:
Appendix / A:
Bibliography
Index
Elementary Techniques / Part I:
The Basics / 1:
Introduction / 1.1:
10.

図書

図書
Werner Kuich, Grzegorz Rozenberg, Arto Salomaa (eds.)
出版情報: Berlin : Springer, c2002  ix, 388 p. ill. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2295
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentations
Automata: From Uncertainty to Quantum / C.S. Calude ; E. Calude
Elementary Theory of Ordinals with Addition and Left Translation by ω / C. Choffrut
The Equational Theory of Fixed Points with Applications to Generalized Language Theory / Z. Ésik
Second-Order Logic over Strings: Regular and Non-regular Fragments / T. Eiter ; G. Gottlob ; T. Schwentick
Decision Questions on Integer Matrices / T. Harju
Some Petri Net Languages and Codes / M. Ito ; Y. Kunimoch
Words, Permutations, and Representations of Numbers / H. Prodinger
Proof Complexity of Pigeonhole Principles / A.A. Razborov
Words and Patterns / A. Restivo ; S. Salemi
A Short Introduction to Infinite Automata / W. Thomas
Contributions
The Power of One-Letter Rational Languages / T. Cachat
The Entropy of Lukasiewicz-Languages / L. Staiger
Collapsing Words vs. Synchronizing Words / D.S. Ananichev ; M.V. Volkov
A Note on Synchronized Automata and Road Coloring Problem / K. Culik ; J. Karhumäki ; J. Kari
Shuffle Quotient and Decompositions / C. Câmpeanu ; K. Salomaa ; S. Vágvölgyi
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages / G. Niemann ; J.R. Woinowski
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable / D. Kuske
Automata on Series-Parallel Biposets / Z.L. Németh
Hierarchies of String Languages Generated by Deterministic Tree Transducers / J. Engelfriet ; S. Maneth
Partially-Ordered Two-Way Automata: A New Characterization of DA / D. Thérien ; H. Vollmer
Level 5/2 of the Straubing-Therien Hierarchy for Two-Letter Alphabets / C. Glaβer ; H. Schmitz
On the Power of Randomized Pushdown Automata / J. Hromkovič ; G. Schnitger
The Root of a Language and Its Complexity / G. Lischke
Valuated and Valence Grammars: An Algebraic View / H. Fernau ; R. Stiebe
Context-Free Valence Grammars - Revisited / H.J. Hoogeboom
An Undecidability Result Concerning Periodic Morphisms / V. Halava
A Universal Turing Machine with 3 States and 9 Symbols / M. Kudlek ; Y. Rogozhin
Minimal Covers of Formal Languages / M. Domaratzki ; J. Shallit ; S. Yu
Some Regular Languages That Are Church-Rosser Congruential / J. Waldmann
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy / M. Beaudry ; M. Holzer ; F. Otto
Forbidden Factors and Fragment Assembly / F. Mignosi ; M. Sciortino
Parallel Communicating Grammar Systems with Incomplete Information Communication / E. Csuhaj-Varjú ; G. Vaszil
Eliminating Communication by Parallel Rewriting / B. Rovan ; M. SlaÜt'an
String Rewriting Sequential P-Systems and Regulated Rewriting / P. Sosík ; R. Freund
Author Index
Invited Presentations
Automata: From Uncertainty to Quantum / C.S. Calude ; E. Calude
Elementary Theory of Ordinals with Addition and Left Translation by ω / C. Choffrut
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼