E. BERTSCH:
Abstract Comparison of two Error Detection Techniques for Programming
Languages.
Journal of Automata, Languages and
Combinatorics 4 (1999) 2, 77–86.
-
V. BRUYÈRE, C. DE FELICE:
On the Existence of Codings Between Trace Monoids.
Journal of Automata, Languages and Combinatorics 4 (1999)
2, 87–100.
-
J. CASSAIGNE:
Double Sequences with Complexity mn+1.
Journal of
Automata, Languages and Combinatorics 4 (1999) 3, 153–170.
-
C. CHOFFRUT, H. PELIBOSSIAN, P. SIMONNET:
Decision
Issues on Functions Realized by Finite Automata.
Journal of Automata, Languages and Combinatorics 4 (1999) 3,
171–181.
-
J. CURRIE, H. PETERSEN, J. M. ROBSON, J. SHALLIT:
Separating
Words with Small Grammars.
Journal of Automata,
Languages and Combinatorics 4 (1999) 2, 101–110.
-
C. DE FELICE:
Hajós Factorizations of Cyclic
Groups – A Simpler Proof of a Characterization.
Journal of Automata, Languages and Combinatorics 4 (1999) 2,
111–116.
-
J. DEVOLDER:
Generators with Bounded Deciphering Delay for Rational
ω-Languages.
Journal of Automata, Languages and
Combinatorics 4 (1999) 3, 183–204.
-
J.-P. DUVAL, L. MOUCHARD:
Sequences Obtained from a Series
of Permutations of Borders and Ultimately Periodic Words.
Journal of Automata, Languages and Combinatorics 4 (1999) 3,
205–211.
-
H. FERNAU, F. STEPHAN:
Characterizations of Recursively Enumerable Languages by Programmed
Grammars with Unconditional Transfer.
Journal of
Automata, Languages and Combinatorics 4 (1999) 2, 117–142.
-
C. S. ILIOPOULOS, L. MOUCHARD:
Quasiperiodicity: From Detection
to Normal Forms.
Journal of Automata, Languages and
Combinatorics 4 (1999) 3, 213–228.
-
P. JANCAR, F. MRÁZ, M. PLÁTEK, J. VOGEL:
On Monotonic
Automata with a Restart Operation.
Journal of
Automata, Languages and Combinatorics 4 (1999) 4, 287–311.
-
R. KEMP:
On
Leftist Simply Generated Trees.
Journal of Automata,
Languages and Combinatorics 4 (1999) 4, 313–331.
-
M. MADONIA, S. SALEMI, T. SPORTELLI:
Covering Submonoids and Covering
Codes.
Journal of Automata, Languages and
Combinatorics 4 (1999) 4, 333–350.
-
A. MAES:
An
Automata Theoretic Decidability Proof for First-Order Theory of langle
nat ,<,P rangle with Morphic Predicate P.
Journal
of Automata, Languages and Combinatorics 4 (1999) 3,
229–245.
-
C. MARTIN-VIDE, G. PĂUN:
Cooperating Distributed Splicing
Systems.
Journal of Automata, Languages and
Combinatorics 4 (1999) 1, 3–16.
-
I. PETRE:
Parikh's
Theorem Does Not Hold for Multiplicities.
Journal of
Automata, Languages and Combinatorics 4 (1999) 1, 17–30.
-
J.-F. RASKIN, P.-Y. SCHOBBENS:
The Logic
of Event Clocks – Decidability, Complexity and Expressiveness.
Journal of Automata, Languages and Combinatorics 4 (1999)
3, 247–282.
-
H.-J. SHYR, S.-S. YU:
Some Properties
of Left Non-Cancellative Languages.
Journal of
Automata, Languages and Combinatorics 4 (1999) 4, 351–360.
-
D. WÄTJEN:
Teams of Limited and Uniformly Limited 0L Systems.
Journal of Automata, Languages and Combinatorics 4 (1999) 1,
31–57.
-
L. ZHANG, K.-P. SHUM, S.-L. PENG:
Generalized
Prefix Relations and Codes with Finite Decoding Delay.
Journal of Automata, Languages and Combinatorics 4 (1999) 1,
59–71.
|
