Jürgen Dassow, Grzegorz Rozenberg, Arto Salomaa
Proceedings of the Second International Conference on Developments in Language Theory: At the Crossroads of Mathematics, Computer Science and Biology
DLT, 1995.

@proceedings{DLT-1995,
	address       = "Magdeburg, Germany",
	editor        = "Jürgen Dassow and Grzegorz Rozenberg and Arto Salomaa",
	isbn          = "981-02-2682-9",
	publisher     = "{World Scientific}",
	title         = "{Proceedings of the Second International Conference on Developments in Language Theory: At the Crossroads of Mathematics, Computer Science and Biology}",
	year          = 1995,
}

Contents (50 items)

8 ×#automaton
7 ×#on the
5 ×#complexity
5 ×#context-free grammar
4 ×#parsing
3 ×#finite
3 ×#linear
3 ×#problem
3 ×#sequence
3 ×#word

DLT-1995-Bercoff #product line #sequence

A Family of p-Uniform Tag Systems for p-Paperfolding Sequences (CB), pp. 3–12.

DLT-1995-Berstel #word

Recent Results on Sturmian Words (JB), pp. 13–24.

DLT-1995-Cassaigne #complexity #linear #sequence

Special Factors of Sequences with Linear Subword Complexity (JC), pp. 25–34.

DLT-1995-CurrieS #set

Cantor Sets and Dejean’s Conjecture (JDC, ROS), pp. 35–43.

DLT-1995-Ilie #on the

On Disjunctivity, Ultimate Periodicity and Ultimate Identity (LI), pp. 44–53.

DLT-1995-KariN

Colored Gauss and Tangent Codes on the Torus (JK, VN), pp. 54–63.

DLT-1995-Mitrana #self #sequence

Binary Self-Adding Sequences (VM), pp. 64–70.

DLT-1995-Georgescu #complexity #context-free grammar #metric #orthogonal

The Orthogonality of Some Complexity Measures of Context-Free Languages (GG), pp. 73–78.

DLT-1995-GvozdjakR #bound #parallel

Time-Bounded Parallel Rewriting (PG, BR), pp. 79–87.

DLT-1995-Holzer #automaton #finite #on the

On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.

DLT-1995-Ito #linear

Height Functions and Linear Languages (MI), pp. 98–101.

DLT-1995-JancarMPPV #automaton #context-free grammar

Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.

DLT-1995-Jedrzejowicz #decidability #problem

An Undecidable Problem for Shuffle Languages (JJ), pp. 112–118.

DLT-1995-KariT #morphism

Morphisms and Associated Congruences (LK, GT), pp. 119–128.

DLT-1995-KudlekM #algebra #distributed

Rational and Algebraic Languages with Distributed Catenation (MK, AM), pp. 129–138.

DLT-1995-Lipponen #on the #problem

On F-Prime Solutions of the Post Correspondence Problem (ML), pp. 139–147.

DLT-1995-MateiT #context-free grammar

(0, 1)-Total Pure Context-Free Grammars (CM, FLT), pp. 148–153.

DLT-1995-SalomaaY #context-free grammar #nondeterminism

Nondeterminism Degrees for Context-Free Languages (KS, SY), pp. 154–165.

DLT-1995-SchieringT #automaton #first-order #logic

Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.

DLT-1995-Weber #automaton #transducer

Transforming a Single-Valued Transducer Into a Mealy Machine (AW), pp. 176–185.

DLT-1995-Banik #turing machine

Colonies as Systems of Turing Machines Without States (IB), pp. 189–198.

DLT-1995-BordihnF #overview #perspective

Accepting Grammars and Systems: An Overview (HB, HF), pp. 199–208.

DLT-1995-Cai #complexity #component

The Computational Complexity of PCGS with Regular Components (LC), pp. 209–219.

DLT-1995-Freund #array

Array Grammars with Prescribed Teams of Array Productions (RF), pp. 220–229.

DLT-1995-Gartner #on the

On Partition Limited OL Systems (SG), pp. 230–236.

DLT-1995-Hromkovic #communication #complexity #generative #on the

On the Communication Complexity of Distributive Language Generation (JH), pp. 237–246.

DLT-1995-Mihalache #communication #parallel

Szilard Languages Associated to Parallel Communicating Grammar Systems (VM), pp. 247–256.

DLT-1995-Rambov

Imposing Vertical Context Conditions on Derivations (OR), pp. 257–266.

DLT-1995-Satta #problem

The Membership Problem for Unordered Vector Languages (GS), pp. 267–275.

DLT-1995-Dorr #abstract interpretation #bound

Computing an Upper Bound for SVS(gg) by Abstract Interpretation (HD), pp. 279–288.

DLT-1995-Drewes #on the

On the Connectedness of Pictures Defined by Iterated Function Systems (FD), pp. 289–298.

DLT-1995-Giammarresi #2d #finite #overview

Finite State Recognizability for Two-Dimensional Languages: A Brief Survey (DG), pp. 299–308.

DLT-1995-Hartmann #performance

Efficient Subgraph Matching Within Cellular Hypergraphs (PH), pp. 309–318.

DLT-1995-KimuraT #graph grammar

Timed Attribute Hypergraph Grammars and Their Based Properties (YK, TT), pp. 319–328.

DLT-1995-Stiebe

Some New Decision Results for Edge Grammars (RS), pp. 329–338.

DLT-1995-CalbrixN

Prefix and Period Languages of Rational ω-Languages (HC, MN), pp. 341–349.

DLT-1995-Lepisto #complexity #infinity #on the #word

On the Computational Complexity of Infinite Words (AL), pp. 350–359.

DLT-1995-LitovskyS #finite #infinity #word

Finite Acceptance of Infinite Words (IL, LS), pp. 360–369.

DLT-1995-DiekertGP #traceability

Recent Developments in Trace Theory (VD, PG, AP), pp. 373–385.

DLT-1995-DrosteK #composition #quantifier

Trace Languages Definable with Modular Quantifiers (MD, DK), pp. 386–395.

DLT-1995-TipleaE #normalisation #petri net

Hierarchies of Petri Net Languages and a Super-Normal Form (FLT, CE), pp. 396–405.

DLT-1995-CattaneoFM #automaton

Rule Space Transformations and One-Dimensional Cellular Automata (GC, EF, GM), pp. 409–419.

DLT-1995-KutribR #automaton #realtime

Real-Time One-Way Pushdown Cellular Automata Languages (MK, JR), pp. 420–429.

DLT-1995-SimaW

Neural Language Acceptors (JS, JW), pp. 430–439.

DLT-1995-Asveld #context-free grammar #parsing #recognition #robust #towards

Towards Robustness in Parsing — Fuzzifying Context-Free Language Recognition (PRJA), pp. 443–453.

DLT-1995-Cases #automaton #self

From Synonymy to Self-Modifying Automata: Q-Diam Language (BC), pp. 454–459.

DLT-1995-Galvez #lr #parsing #stack

A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning (JFG), pp. 460–465.

DLT-1995-Gramatovici #parsing

Introducing the Operational Parser (RG), pp. 466–471.

DLT-1995-Nederhof #automaton #bidirectional #parsing

Reversible Pushdown Automata and Bidirectional Parsing (MJN), pp. 472–481.

DLT-1995-Nitsche #linear #logic #semantics

A Finitary-Language Semantics for Propositional Linear Temporal Logic (UN), pp. 482–489.