Sciweavers

2465 search results - page 25 / 493
» Automata on Linear Orderings
Sort
View
RTA
2000
Springer
13 years 11 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret
LICS
1995
IEEE
13 years 11 months ago
Decision Problems for Second-Order Linear Logic
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
Patrick Lincoln, Andre Scedrov, Natarajan Shankar
IJBRA
2008
101views more  IJBRA 2008»
13 years 7 months ago
Analysing formal models of genetic regulatory networks with delays
: In this paper, we propose a refinement of the modelling of biological regulatory networks based on the discrete approach of Ren
Jamil Ahmad, Olivier Roux, Gilles Bernot, Jean-Pau...
DIAGRAMS
2008
Springer
13 years 9 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
CSR
2007
Springer
13 years 11 months ago
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
Victor Poupet