Вы здесь

Главная

Fundamentals of Computation Theory

Связанные издания:

About Planar Cayley Graphs
A Delegation-based Object Calculus with Subtyping
A Duration Calculus with Infinite Intervals
A simple abstract semantics for equational theories
Axiomatizing Petri Net Concatenable Processes
Categorial Graphs (Extended Abstract)
Communication as Unification in the Petri Box Calculus
Computing Petri Net Languages by Reductions
Discrete Time Process Algebra with Abstraction
Distributed Catenation and Chomsky Hierarchy
Dummy Elimination: Making Termination Easier
Effective Category and Measure in Abstract Complexity Theory
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids
Efficient rewriting in cograph trace monoids
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Formal Parametric Equations
From a Concurrent Lambda-Calculus to the Pi-Calculus
Functional Sorts in Data Type Specifications. A Geometric Approach to Semantics
Growing Patterns in 1D Cellular Automata
How Hard is to Compute the Edit Distance
Implementation of a UU-Algorithm for Primitive Recursive Tree Functions
Model-Checking for Real-Time Systems
On Condorcet and Median Points of Simple Rectilinear Polygons
On Polinomial Ideals, Their Complexity, and Applications
On the sinchronization of semi-traces
Optimal Contiguous Expression DAG Evaluations
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
PRAM s Towards Realistic Parallelism: BRAM s
Processes with Multiple Entries and Exits
Properties of Probabilistic Pushdown Automata
Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space
r-Domination Problems on Homogeneously Orderable Graphs
Restarting Automata
Rewriting Regular Inequalities
Some Results Concerning Two-Dimensional Turing Machines and Finite Automata
The Power of Frequency Computation
Tiling with bars and satisfaction of boolean formulas