Symeon Bozapalidis
Proceedings of the Third International Conference on Developments in Language Theory
DLT, 1997.

@proceedings{DLT-1997,
	address       = "Thessaloniki, Greece",
	editor        = "Symeon Bozapalidis",
	publisher     = "{Aristotle University of Thessaloniki}",
	title         = "{Proceedings of the Third International Conference on Developments in Language Theory}",
	year          = 1997,
}

Contents (44 items)

8 ×#automaton
4 ×#algebra
4 ×#bound
4 ×#on the
3 ×#context-free grammar
2 ×#ambiguity
2 ×#complexity
2 ×#distributed
2 ×#logic
2 ×#multi

DLT-1997-PazC #array #automaton #evolution #probability

Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays) (AP, JWC), pp. 9–35.

DLT-1997-GecsegI #automaton #on the #set

On complete sets of tree automata (FG, BI), pp. 37–47.

DLT-1997-Kuich #automaton #named

Semirings: A basis for a mathematical automata and language theory (WK), pp. 49–60.

DLT-1997-Kuich97a

Formal Power Series over Trees (WK), pp. 61–101.

DLT-1997-KarhumakiPM #bound #constant

A lower bound for a constant in Shallit’s conjecture (JK, WP, FM), pp. 103–118.

DLT-1997-MantaciR #equation

Tree Codes and Equations (SM, AR), pp. 119–133.

DLT-1997-CastelliGM

Indecomposable prefix codes and prime trees (MGC, DG, SM), pp. 135–145.

DLT-1997-IwamaT #automaton #bound #nondeterminism

Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.

DLT-1997-WatanabeT #attribute grammar #using

An Attribute Evaluation of One-Pass Attribute Grammars Using Value Estimate (YW, TT), pp. 155–165.

DLT-1997-NiemiR #multi

Multiparty Computations with a Deck of Cards (VN, AR), pp. 167–174.

DLT-1997-Mihalache #communication #hybrid #parallel

Hybrid Parallel Communicating Grammar Systems (VM), pp. 175–189.

DLT-1997-JancarMPPV #automaton

Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.

DLT-1997-Hirvensalo #quantum

The Reversibility in Quantum Computation Theory (MH), pp. 203–210.

DLT-1997-Cassaigne #sequence

Sequences with grouped factors (JC), pp. 211–222.

DLT-1997-IkedaA #complexity #on the

On the Complexity of Languages Definable by Hereditary Elementary Formal Systems (DI, HA), pp. 223–235.

DLT-1997-NiessnerNO #liveness

Deterministic ω-regular liveness properties (FN, UN, PO), pp. 237–248.

DLT-1997-FernauS #how

How Powerful is Unconditional Transfer? — When UT meets AC (HF, FS), pp. 249–260.

DLT-1997-FernauHF #bound #distributed

Bounding resources in Cooperating Distributed Grammar Systems (HF, MH, RF), pp. 261–272.

DLT-1997-LitovskyP #on the

On a Binary Zigzag Operation (IL, BP), pp. 273–289.

DLT-1997-Bozapalidis #algebra

Mezei-Wright Theory on N-Subsets of an Algebra (SB), pp. 291–298.

DLT-1997-Julia

A characteristic language for rational ω-power (SJ), pp. 299–308.

DLT-1997-Paun #distributed

Two-Level Distributed H Systems (GP), pp. 309–327.

DLT-1997-MrazPP #automaton

Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.

DLT-1997-Moshkov #complexity #nondeterminism #recognition #regular expression #word

Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.

DLT-1997-MateescuSY #context-free grammar #decidability

Decidability of fairness for context-free languages (AM, KS, SY), pp. 351–364.

DLT-1997-BuchholzK #bound #on the #power of

On the power of one-way bounded cellular time computers (TB, MK), pp. 365–375.

DLT-1997-Seemann #multi

Multiple-limited ET0L Systems (MS), pp. 377–385.

DLT-1997-Kudlek

Mix Operation with Catenation and Shuffle (MK), pp. 387–398.

DLT-1997-Ilie #order #word

Remarks on Well Quasi Orders of Words (LI), pp. 399–409.

DLT-1997-DavidES #learning #string

Learning String Adjunct and Tree Adjunct Languages (NGD, JDE, KGS), pp. 411–427.

DLT-1997-DassowMP #context-free grammar

Point mutations in context-free languages (JD, VM, GP), pp. 429–446.

DLT-1997-RahonisS #algebra

Hierarchies of synchronized and algebraic forests (GR, KS), pp. 447–460.

DLT-1997-TipleaM #petri net

Jumping Petri Nets — Specific Properties (FLT, EM), pp. 461–476.

DLT-1997-Dassow

Some Remarks on Extended Reular Languages (JD), pp. 477–488.

DLT-1997-MateescuM #infinity

Infinite trajectories (AM, GDM), pp. 489–505.

DLT-1997-Neumann #ambiguity #automaton #modelling #revisited

Unambiguity of SGML Content Models — Pushdown Automata Revisited (AN), pp. 507–518.

DLT-1997-CaludeCK #automaton #simulation

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (CSC, EC, BK), pp. 519–537.

DLT-1997-Polemi #algebra #geometry

An Algebraic-Geometric Public Key Cryptosystem (DP), pp. 521–528.

DLT-1997-Raeva #ambiguity #logic #semantics

Semantic Interpretation of Ambiguous Statements, Represented in a Logical Form (IR), pp. 529–537.

DLT-1997-Zhiltsova #context-free grammar #probability

An Optimal Coding for Stochastic Context-Free Languages with Unique Derivation (LPZ), pp. 539–550.

DLT-1997-TokudaYW #re-engineering

Deterministic Reconstruction of Context-Free Derivations for a Sentence with Shuffled Terminal Symbols (TT, KY, YW), pp. 551–558.

DLT-1997-RaskovaR #algebra #formal method #recursion

Recursive Constructions in the Theory of P.I. Algebras (TGR, PIR), pp. 559–566.

DLT-1997-Kurerov #graph grammar

Resolution-Similar Graph Grammars (YNK), pp. 567–577.

DLT-1997-Stefaneas #first-order #logic

Chartering first order logic (PSS), pp. 579–592.