The SCEAS System
Navigation Menu

Conferences in DBLP

Birthday ... (birthday)
1997 (conf/birthday/Dassow1997)

  1. Jürgen Avenhaus, Klaus Madlener
    Theorem Proving in Hierarchical Causal Specifications. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:1-51 [Conf]
  2. Henning Bordihn
    A Grammatical Approach to the LBA Problem. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:1-9 [Conf]
  3. Henning Fernau, Markus Holzer
    Conditional Context-Free Languages of Finite Index. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:10-26 [Conf]
  4. Alexander Meduna
    On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:27-38 [Conf]
  5. Victor Mitrana, Ralf Stiebe
    The Accepting Power of Finite Automata over Groups. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:39-48 [Conf]
  6. Peter R. J. Asveld
    Controlled Fuzzy Parallel Rewriting. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:49-70 [Conf]
  7. José L. Balcázar, Josep Díaz, Ricard Gavaldà
    Algorithms for Learning Finite Automata from Queries: A Unified View. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:53-72 [Conf]
  8. Paolo Bottoni, Giancarlo Mauri, Piero Mussio
    On Controlling Rewriting by Properties of Strings and Symbols. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:71-94 [Conf]
  9. José L. Balcázar, Ricard Gavaldà, Osamu Watanabe
    Coding Complexity: The Computational Complexity of Succinct Descriptions. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:73-91 [Conf]
  10. Franz-Josef Brandenburg
    Homomorphic Representations of Certain Classes of Languages. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:93-110 [Conf]
  11. Henning Fernau, Rudolf Freund
    Accepting Array Grammars with Control Mechanisms. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:95-118 [Conf]
  12. Helmut Jürgensen, Kai Salomaa
    Block-Synchronization Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:111-137 [Conf]
  13. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    On Restarting Automata with Rewriting. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:119-136 [Conf]
  14. Valeria Mihalache, Victor Mitrana
    Deterministic Cooperating Distributed Grammar Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:137-149 [Conf]
  15. Johannes Köbler, Uwe Schöning
    High Sets for NP. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:139-156 [Conf]
  16. Tudor Balanescu, Horia Georgescu, Marian Gheorghe
    Grammar Systems with Counting Derivation and Dynamical Priorities. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:150-166 [Conf]
  17. Ming Li, Paul M. B. Vitányi
    Average-Case Analysis Using Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:157-169 [Conf]
  18. Sorina Dumitrescu
    Characterization of RE Using CD Grammar Systems with Two Registers and RL Rules. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:167-177 [Conf]
  19. Amy K. Lorentz, Jack H. Lutz
    Genericity and Randomness over Feasible Probability Measures. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:171-187 [Conf]
  20. Dietmar Wätjen
    On Cooperating Distributed Uniformly Limited 0L Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:178-196 [Conf]
  21. Robert McNaughton
    Book's Impact on the Theory of Thue Systems - Abstract. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:189-190 [Conf]
  22. Dieter van Melkebeek, Mitsunori Ogihara
    Sparse Hard Sets for P. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:191-208 [Conf]
  23. Maurice H. ter Beek
    Teams in Grammar Systems: Sub-Context-Free Cases. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:197-216 [Conf]
  24. Pekka Orponen
    A Survey of Continous-Time Computation Theory. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:209-224 [Conf]
  25. Mohamed Amin
    A Note on the Incomparability of the EOL Family with Certain Families of Languages Generated by Cooperating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:217-219 [Conf]
  26. Jozef Kelemen
    Colonies as Models of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:220-235 [Conf]
  27. Friedrich Otto, Yuji Kobayashi
    Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:225-266 [Conf]
  28. Petr Sosík, Leos Stýbnar
    Grammatical Inference of Colonies. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:236-246 [Conf]
  29. Karl R. Abrahamson, Liming Cai, Steve Gordon
    A Grammar Characterization of Logarithmic-Space Computation. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:247-255 [Conf]
  30. Stefan D. Bruda
    On the Computational Complexity of Context-Free Parallel Communicating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:256-266 [Conf]
  31. Daniel Popescu
    Parallel Communicating Grammar Systems with Communication by Signals. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:267-277 [Conf]
  32. Eljas Soisalon-Soininen, Peter Widmayer
    Relaxed Balancing in Search Trees. [Citation Graph (1, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:267-283 [Conf]
  33. Adrian Chitu
    PC Grammar Systems Versus Some Non-Context-Free Constructions from Natural and Artificial Languages. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:278-287 [Conf]
  34. Heribert Vollmer, Klaus W. Wagner
    Measure One Results in Computational Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:285-312 [Conf]
  35. Maria Dolores Jiménez-López, Carlos Martín-Vide
    Grammar Systems for the Description of Certain Natural Language Facts. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:288-298 [Conf]
  36. Erzsébet Csuhaj-Varjú, Arto Salomaa
    Networks of Parallel Language Processors. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:299-318 [Conf]
  37. Jie Wang
    Average-Case Intractable NP Problems. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:313-378 [Conf]
  38. Claudio Zandron, Claudio Ferretti, Giancarlo Mauri
    A Reduced Distributed Splicing System for RE Languages. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:319-329 [Conf]
  39. Gianina Georgescu
    On the Generative Capacity of Splicing Grammar Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:330-345 [Conf]
  40. Kamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama
    Array Splicing Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:346-365 [Conf]
  41. Juraj Hromkovic, Juhani Karhumäki
    Two Lower Bounds on Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:366-376 [Conf]
  42. Ludwig Staiger
    On omega-power Languages. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:377-394 [Conf]
  43. Peng-Jun Wan, Feng Cao
    Multichannel Lightwave Networks. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:379-396 [Conf]
  44. Alexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa
    Shuffle-like Operations on omega-words. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:395-411 [Conf]
  45. Werner Kuich
    Generalized Lindenmayerian Algebraic Systems. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:412-421 [Conf]
  46. Virgil Emil Cazanescu
    The Structure of the Basic Morphisms. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:422-429 [Conf]
  47. Manfred Kudlek, Alexandru Mateescu
    On Mix Operation. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:430-439 [Conf]
  48. Markus Holzer, Klaus-Jörn Lange
    On the Complexity of Iterated Insertions. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:440-453 [Conf]
  49. Lucian Ilie
    The Decidability of the Generalized Confluence Problem for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:454-464 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002