default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automata, Languages and Combinatorics, Volume 4
Volume 4, Number 1, 1999
- Carlos Martín-Vide, Gheorghe Paun:
Cooperating Distributed Splicing Systems. 3-16 - Ion Petre:
Parikh's Theorem Does Not Hold for Multiplicities. 17-30 - Dietmar Wätjen:
Teams of Limited and Uniformly Limited 0L Systems. 31-57 - Liang Zhang, Kar-Ping Shum, Shou-Li Peng:
Generalized Prefix Relations and Codes with Finite Decoding Delay. 59-71
Volume 4, Number 2, 1999
- Eberhard Bertsch:
Abstract Comparison of two Error Detection Techniques for Programming Languages. 77-86 - Véronique Bruyère, Clelia de Felice:
On the Existence of Codings Between Trace Monoids. 87-100 - James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit:
Separating Words with Small Grammars. 101-110 - Clelia de Felice:
Hajós Factorizations of Cyclic Groups - A Simpler Proof of a Characterization. 111-116 - Henning Fernau, Frank Stephan:
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer. 117-142
Volume 4, Number 3, 1999
- Véronique Bruyère:
Editorial. 149-151 - Julien Cassaigne:
Double Sequences with Complexity mn+1. 153-170 - Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet:
Decision Issues on Functions Realized by Finite Automata. 171-181 - Jeanne Devolder:
Generators with Bounded Deciphering Delay for Rational ω-Languages. 183-204 - Jean-Pierre Duval, Laurent Mouchard:
Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words. 205-211 - Costas S. Iliopoulos, Laurent Mouchard:
Quasiperiodicity: From Detection to Normal Forms. 213-228 - Arnaud Maes:
An Automata Theoretic Decidability Proof for First-Order Theory of ⟨ℕ,<,P⟩ with Morphic Predicate P. 229-245 - Jean-François Raskin, Pierre-Yves Schobbens:
The Logic of Event Clocks - Decidability, Complexity and Expressiveness. 247-282
Volume 4, Number 4, 1999
- Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Monotonic Automata with a Restart Operation. 287-311 - Rainer Kemp:
On Leftist Simply Generated Trees. 313-331 - Maria Madonia, Sergio Salemi, Tecla Sportelli:
Covering Submonoids and Covering Codes. 333-350 - Huei-Jan Shyr, Shyr-Shen Yu:
Some Properties of Left Non-Cancellative Languages. 351-360
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
