Kai Salomaa: Publications 1995-99

• K. Salomaa, S. Yu: Synchronization expressions and languages. Journal of Universal Computer Science, Vol. 5 Nr. 9 (1999) 610-621.
• K. Salomaa, S. Yu: Generalized fairness and context-free languages. Acta Cybernetica, Vol. 14 (1999) 193-203.
• K. Salomaa, S. Yu: Synchronization expressions: Characterization results and implementation. In: ``Jewels are Forever'', J. Karhum\"aki, H. Maurer, G. Paun, G. Rozenberg (Eds.), Springer-Verlag, 1999, pp. 45-56.
• G. Rahonis, K. Salomaa: On the size of stack and synchronization alphabets of tree automata. Fundamenta Informaticae, Vol. 36 (1998) 57-69.
• K. Salomaa, S. Yu: Synchronization expressions with extended join operation. Theoretical Computer Science, Vol. 207 (1998) 73--88.
• S. Huerter, K. Salomaa, X. Wu, S. Yu: Implementing reversed alternating finite automaton (r-AFA) operations. Proceedings of the Third International Workshop on Implementing Automata, WIA'98, (September 1998, Rouen, France), Lect. Notes Comput. Sci. 1660, Springer-Verlag, 1999, pp. 69-81.
• K. Salomaa, X. Wu, S. Yu: Efficient implementation of regular  languages using r-AFA.Proceedings of the Second International Workshop on Implementing Automata, WIA'97, (London, Ontario, Second International Workshop on Implementin g Automata, WIA'97, (London, Ontario, Canada, September 1997), Lect. Notes Comput. Sci. 1436, Springer-Verlag, 1998, pp. 176-184.
• A. Ehrenfeucht, G. Rozenberg, K. Salomaa: Semantics of nonsequential tree-based computation schemes. Fundamenta Informaticae, Vol. 29 (1997) 305-324.
• K. Salomaa, S. Yu: NFA to DFA transformation for finite languages over arbitrary alphabets.  Journal of Automata, Languages and Combinatorics, Vol.  2 (1997) 177-186.
• K. Salomaa, S. Yu: Loop-free alternating finite automata.  Proceedings of the 8th International Conference on Automata and Formal Languages, (Salgotarj an, Hungary, August 1996), Publicationes Mathematicae Debrecen, Vol. 54 (1999) 979-988.
• G. Rahonis, K. Salomaa: Hierarchies of synchronized and algebraic forests.  Proceedings of the Third International Conference on Developments in Language Theory, DLT'97 (Thessaloniki, July 20--23, 1997), S. Bozapalidis (Ed.), pp. 447-460.
• A. Mateescu, K. Salomaa, S. Yu: Decidability of fairness for context-free languages.  Proceedings of the Third International Conference on Developmen ts in Language Theory, DLT'97 (Thessaloniki, July 20-23, 1997), S. Bozapalidis (Ed.), pp. 351-364.
• H. Jurgensen, K. Salomaa: Block-synchronization context-free grammars. In: ``Advances in Algorithms, Languages, and Complexity'', Ding-Zhu Du, Ker-I Ko (Eds.), Kluwer Academic Publishers, 1997, pp. 111-137.
• K. Salomaa, S. Yu: Rewriting rules for synchronization languages. In: ``Structur es in Logic and Computer Science. A Selection of Essays in Honor of A. Ehrenfeucht' ', Lect. Notes Comput. Sci. 1261 (1997) 322-338.
• K. Salomaa, S. Yu: NFA to DFA transformation for finite languages.  Automata Implementation. Proceedings of WIA'96 (London, Ontario, Canada, August 1996), Lect. Notes Comput. Sci.  1260, Springer-Verlag, 1997, pp. 149-158.
• K. Salomaa: Decidability of equivalence for deterministic synchronized tree automata.  Theoretical Computer Science, Vol.  167 (1996) 171-192.
• K. Salomaa: Yield-languages of two-way pushdown tree automata.  Information Processing Letters, Vol.  58 (1996) 195-199.
• K. Salomaa, D. Wood, S. Yu: Structural equivalence and ET0L grammars.  Theoretical Computer Science, Vol.  164 (1996) 123-140.
• K. Salomaa: On the modularity of decidability of completeness and termination.&n bsp; Journal of Automata, Languages and Combinatorics, Vol.  1 (1996) 37-53.
• L. Guo, K. Salomaa, S. Yu: On synchronization languages.  Fundamenta Informaticae, Vol. 25 (1996) 423-436.
• K. Salomaa, S. Yu: EDT0L structural equivalence is decidable.  Combinatoric s, Complexity, & Logic, Proceedings of DMTCS'96 (Auckland, New Zealand, December 1996), Springer-Verlag, 1996, pp. 363-375.
• K. Salomaa, S. Yu: Nondeterminism degrees for context-free languages.  Proceedings of the Second International Conference on Developments in Language Theory, DLT (Magdeburg, Germany), World Scientific, Singapore, 1996, pp. 154-165.
• A. Mateescu, A. Salomaa, K. Salomaa, S. Yu: P, NP and Post Correspondence Problem. Information and Computation, Vol. 121 (1995) 135-142.
• T. Jiang, A. Salomaa, K. Salomaa, S. Yu: Decision problems for patterns. Journal of Computer and System Sciences, Vol. 50 (1995) 53-63.
• A. Mateescu, A. Salomaa, K. Salomaa, S. Yu: Lexical analysis with a simple finite-fuzzy-automaton model. Journal of Universal Computer Science, Vol. 1, No. 5 (1995) 288-307.
• K. Salomaa, D. Wood, S. Yu: Complexity of E0L structural equivalence. RAIRO Theoretical Informatics and Applications, Vol. 29 (1995) 471-485.
• K. Salomaa: Decidability of equivalence for deterministic synchronized tree automata. Proceedings of the Sixth International Joint Conference on the Theory and Practice of Software Development, TAPSOFT--CAAP'95 (Aarhus, Denmark), Lect. Notes Comput. Sci. 915, Springer-Verlag, 1995, pp. 140-154.