3. DLT 1997:
Thessaloniki,
Greece
Symeon Bozapalidis (Ed.):
Proceedings of the 3rd International Conference Developments in Language Theory, DLT 1997, Thessaloniki, Greece, July 20-23, 1997.
Aristotle University of Thessaloniki 1997 
- Azaria Paz, Jack W. Carlyle:
Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays).
9-35
- Ferenc Gécseg, Balázs Imreh:
On complete sets of tree automata.
37-47
- Werner Kuich:
Semirings: A basis for a mathematical automata and language theory.
49-60
- Werner Kuich:
Formal Power Series over Trees.
61-101
- Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
A lower bound for a constant in Shallit's conjecture.
103-118
- Sabrina Mantaci, Antonio Restivo:
Tree Codes and Equations.
119-133
- Maria Gabriella Castelli, Daniela Guaiana, Sabrina Mantaci:
Indecomposable prefix codes and prime trees.
135-145
- Kazuo Iwama, Kazuya Takaki:
Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's.
147-154
- Yoshimichi Watanabe, Takehiro Tokuda:
An Attribute Evaluation of One-Pass Attribute Grammars Using Value Estimate.
155-165
- Valtteri Niemi, Ari Renvall:
Multiparty Computations with a Deck of Cards.
167-174
- Valeria Mihalache:
Hybrid Parallel Communicating Grammar Systems.
175-189
- Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel:
Deleting Automata with a Restart Operation.
191-202
- Mika Hirvensalo:
The Reversibility in Quantum Computation Theory.
203-210
- Julien Cassaigne:
Sequences with grouped factors.
211-222
- Daisuke Ikeda, Hiroki Arimura:
On the Complexity of Languages Definable by Hereditary Elementary Formal Systems.
223-235
- Frank Nießner, Ulrich Nitsche, Peter Ochsenschläger:
Deterministic omega-regular liveness properties.
237-248
- Henning Fernau, Frank Stephan:
How Powerful is Unconditional Transfer? - When UT meets AC.
249-260
- Henning Fernau, Markus Holzer, Rudolf Freund:
Bounding resources in Cooperating Distributed Grammar Systems.
261-272
- Igor Litovsky, Bruno Patrou:
On a Binary Zigzag Operation.
273-289
- Symeon Bozapalidis:
Mezei-Wright Theory on N-Subsets of an Algebra.
291-298
- Sandrine Julia:
A characteristic language for rational omega-power.
299-308
- Gheorghe Paun:
Two-Level Distributed H Systems.
309-327
- Frantisek Mráz, Martin Plátek, Martin Procházka:
Deleting Automata with a Restart Operation and Marcus Grammars.
329-342
- Mikhail Moshkov:
Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition.
343-349
- Alexandru Mateescu, Kai Salomaa, Sheng Yu:
Decidability of fairness for context-free languages.
351-364
- Thomas Buchholz, Martin Kutrib:
On the power of one-way bounded cellular time computers.
365-375
- Markus Seemann:
Multiple-limited ET0L Systems.
377-385
- Manfred Kudlek:
Mix Operation with Catenation and Shuffle.
387-398
- Lucian Ilie:
Remarks on Well Quasi Orders of Words.
399-409
- N. Gnanamalar David, J. D. Emerald, K. G. Subramanian:
Learning String Adjunct and Tree Adjunct Languages.
411-427
- Jürgen Dassow, Victor Mitrana, Gheorghe Paun:
Point mutations in context-free languages.
429-446
- George Rahonis, Kai Salomaa:
Hierarchies of synchronized and algebraic forests.
447-460
- Ferucio Laurentiu Tiplea, Erkki Mäkinen:
Jumping Petri Nets - Specific Properties.
461-476
- Jürgen Dassow:
Some Remarks on Extended Reular Languages.
477-488
- Alexandru Mateescu, George Daniel Mateescu:
Infinite trajectories.
489-505
- Andreas Neumann:
Unambiguity of SGML Content Models - Pushdown Automata Revisited.
507-518
- Cristian S. Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract.
519-537
- Despina Polemi:
An Algebraic-Geometric Public Key Cryptosystem.
521-528
- Iliana Raeva:
Semantic Interpretation of Ambiguous Statements, Represented in a Logical Form.
529-537
- L. P. Zhiltsova:
An Optimal Coding for Stochastic Context-Free Languages with Unique Derivation.
539-550
- Takehiro Tokuda, Kouji Yamamoto, Yoshimichi Watanabe:
Deterministic Reconstruction of Context-Free Derivations for a Sentence with Shuffled Terminal Symbols.
551-558
- Tsetska G. Raskova, Peter I. Rashkov:
Recursive Constructions in the Theory of P.I. Algebras.
559-566
- Yury N. Kur'erov:
Resolution-Similar Graph Grammars.
567-577
- Petros S. Stefaneas:
Chartering first order logic.
579-592
Copyright © Mon Nov 2 20:30:48 2009
by Michael Ley (ley@uni-trier.de)
