Grzegorz Rozenberg, Wolfgang Thomas
Proceedings of the Fourth International Conference on Developments in Language Theory, Foundations, Applications, and Perspectives
DLT, 1999.
@proceedings{DLT-1999, address = "Aachen, Germany", editor = "Grzegorz Rozenberg and Wolfgang Thomas", isbn = "981-02-4380-4", publisher = "{World Scientific}", title = "{Proceedings of the Fourth International Conference on Developments in Language Theory, Foundations, Applications, and Perspectives}", year = 1999, }
Contents (31 items)
- DLT-1999-CarpiLV
- Special factors in some combinational structures (AC, AdL, SV), pp. 3–13.
- DLT-1999-Cassaigne #complexity
- Subword complexity and periodicity in two or more dimensions (JC), pp. 14–21.
- DLT-1999-SalomaaY #composition #finite #on the
- On the decomposition of finite languages (AS, SY), pp. 22–31.
- DLT-1999-Yokomori #paradigm #self #towards
- Computation = self-assembly + conformational change: toward new computing paradigms (TY), pp. 32–43.
- DLT-1999-BealC
- Asynchronous sliding block maps (MPB, OC), pp. 47–59.
- DLT-1999-CaludeC #automaton #behaviour #bisimulation #nondeterminism
- Bisimulations and behaviour of nondeterministic automata (CC, EC), pp. 60–70.
- DLT-1999-JirickaK #automaton #finite #nondeterminism
- Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.
- DLT-1999-KvetonK
- Functions preserving classes of languages (PK, VK), pp. 81–102.
- DLT-1999-NiemannO #automaton
- Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.
- DLT-1999-Platek
- Weak cyclic forms of rw-automata (MP), pp. 115–124.
- DLT-1999-Wich #ambiguity #context-free grammar #exponential
- Exponential ambiguity of context-free grammars (KW), pp. 125–138.
- DLT-1999-Anselmo #problem
- A non-ambiguous language factorization problem (MA), pp. 141–152.
- DLT-1999-FernauR #decidability
- Decidability of code properties (HF, KR, LS), pp. 153–163.
- DLT-1999-KarhumakiM #fault #theorem
- Defect theorems for trees (JK, SM), pp. 164–177.
- DLT-1999-KarhumakiP #complexity #on the #order #string
- On the complexity of computing the order of repetition of a string (JK, WP), pp. 178–184.
- DLT-1999-LoftusSW #problem
- New problems of pattern avoidance (JL, JS, MwW), pp. 185–199.
- DLT-1999-LopezN #induction
- Substitutions from Rauzy induction (LML, PN), pp. 200–209.
- DLT-1999-Manuch #word
- Characterization of a word by its subwords (JM), pp. 210–219.
- DLT-1999-Petre #on the
- On semilinearity in formal power series (IP), pp. 220–231.
- DLT-1999-RuizG
- Right and left strongly locally testable semigroups and languages (JR, PG), pp. 232–241.
- DLT-1999-AndreBC #bound #decidability #on the #query
- On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.
- DLT-1999-AndreiK #bidirectional #linear #parsing
- Bidirectional parsing for linear languages (SA, MK), pp. 257–269.
- DLT-1999-Bruggemann-KleinW #automaton #pattern matching
- Caterpillars, context, tree automata and tree pattern matching (ABK, DW), pp. 270–285.
- DLT-1999-KlarlundDS #constraints #logic #named #parsing
- Yakyak: parsing with logical side constraints (NK, ND, MIS), pp. 286–301.
- DLT-1999-BordihnH #component #distributed
- Cooperating distributed grammar systems with non-terminating components (HB, MH), pp. 305–315.
- DLT-1999-BuchholzKK #automaton #on the
- On tally languages and generalized interacting automata (TB, AK, MK), pp. 316–325.
- DLT-1999-DrewesKK
- Table-driven and context-sensitive collage languages (FD, RKH, HJK), pp. 326–337.
- DLT-1999-FreundF
- Test tube systems: when two tubes are enough (RF, FF), pp. 338–350.
- DLT-1999-Holzer #on the
- On fixed and general membership for external and internal contextual languages (MH), pp. 351–361.
- DLT-1999-Martin-VideM
- Contextual grammars with trajectories (CMV, AM), pp. 362–374.
- DLT-1999-Stiebe #matrix
- Slender matrix languages (RS), pp. 375–385.
6 ×#on the
5 ×#automaton
2 ×#complexity
2 ×#decidability
2 ×#finite
2 ×#nondeterminism
2 ×#parsing
2 ×#problem
5 ×#automaton
2 ×#complexity
2 ×#decidability
2 ×#finite
2 ×#nondeterminism
2 ×#parsing
2 ×#problem