11 (2006) 1
Special Issue:
Selected Papers of the International Workshop on
Security Analysis of Systems: Formalisms and Tools
(Orléans, France, June 21–22, 2004)
M. BAUDET:
Random
Polynomial-Time Attacks and Dolev-Yao Models.
Journal
of Automata, Languages and Combinatorics 11 (2006) 1, 7–21.
-
J. CHEN:
Timed
Extensions of π Calculus.
Journal of Automata,
Languages and Combinatorics 11 (2006) 1, 23–58.
-
H. GRALL:
A
Confinement Criterion for Securely Executing Mobile Code.
Journal of Automata, Languages and Combinatorics 11 (2006) 1,
59–106.
-
S. LIMET, G. SALZER:
Basic
Rewriting via Logic Programming, with an Application to the Reachability
Problem.
Journal of Automata, Languages and
Combinatorics 11 (2006) 1, 107–142.
11 (2006) 2
-
P. R. J. ASVELD:
Generating all Circular Shifts by
Context-Free Grammars in Chomsky Normal Form.
Journal
of Automata, Languages and Combinatorics 11 (2006) 2,
147–159.
-
F. GÉCSEG, B. IMREH:
On
Asynchronous Tree Automata.
Journal of Automata,
Languages and Combinatorics 11 (2006) 2, 161–168.
-
O. H. IBARRA,
B. RAVIKUMAR, C. E. GEREDE:
Quality-Aware Service Delegation in Automated Web Service
Composition: An Automata-Theoretic Approach.
Journal
of Automata, Languages and Combinatorics 11 (2006) 2,
169–188.
-
A. KROKHIN, I. G. ROSENBERG:
A Monoidal Interval of Clones of Selfdual Functions.
Journal of Automata, Languages and Combinatorics 11
(2006) 2, 189–208.
-
D. WÄTJEN:
Limited Simple Eco-Grammar Systems with Prescribed Teams.
Journal of Automata, Languages and Combinatorics 11 (2006)
2, 209–231.
11 (2006) 3
Special Issue:
Selected Papers dedicated to
Membrane Computing
-
R. BRIJDER, M. CAVALIERE, A. RISCOS-NÚÑEZ, G. ROZENBERG, D. SBURLAN:
Communication Membrane Systems with
Active Symports.
Journal of Automata, Languages and
Combinatorics 11 (2006) 3, 241–261.
-
M. CAVALIERE, R. FREUND, A. LEITSCH, G. PĂUN:
Event-Related Outputs of
Computations in P Systems.
Journal of Automata,
Languages and Combinatorics 11 (2006) 3, 263–278.
-
Z. DANG, O. H. IBARRA, C. LI, G. XIE:
On the Decidability of Model-Checking
for P Systems.
Journal of Automata, Languages and
Combinatorics 11 (2006) 3, 279–298.
-
T.-O. ISHDORJ:
Power and Efficiency of Minimal
Parallelism in Polarizationless P Systems.
Journal of
Automata, Languages and Combinatorics 11 (2006) 3, 299–320.
-
J. KLEIJN, M. KOUTNY, G. ROZENBERG:
Process Semantics for Membrane
Systems.
Journal of Automata, Languages and
Combinatorics 11 (2006) 3, 321–340.
11 (2006) 4
-
M. H. TER BEEK,
G. LENZINI, M. PETROCCHI:
A Team
Automaton Scenario for the Analysis of Security Properties of Communication
Protocols.
Journal of Automata, Languages and
Combinatorics 11 (2006) 4, 345–374.
-
D. GENOVA, N. JONOSKA:
Topological
Properties of Forbidding-Enforcing Systems.
Journal of
Automata, Languages and Combinatorics 11 (2006) 4, 375–397.
-
L. HADDAD, D. LAU, I. G. ROSENBERG:
Intervals
of Partial Clones Containing Maximal Clones.
Journal
of Automata, Languages and Combinatorics 11 (2006) 4,
399–421.
-
M. J. P. JIMÉNEZ, A. R.
JIMÉNEZ, F. S. CAPARRINI:
A
Polynomial Complexity Class in P Systems Using Membrane Division.
Journal of Automata, Languages and Combinatorics 11
(2006) 4, 423–434.
-
B. SUNCKEL:
On the
Descriptional Complexity of External Hybrid Cooperating Distributed Grammar
Systems.
Journal of Automata, Languages and
Combinatorics 11 (2006) 4, 435–447.
|
