The SCEAS System
Navigation Menu

Conferences in DBLP

Developments in Language Theory (dlt)
2002 (conf/dlt/2002)

  1. Tero Harju, Grzegorz Rozenberg
    Computational Processes in Living Cells: Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:1-20 [Conf]
  2. Masahiro Kitagawa
    Experimental Quantum Computation with Molecules. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:21-27 [Conf]
  3. Sebastian Seibert
    Efficient Transformations from Regular Expressions to Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:28-42 [Conf]
  4. Zoltán Ésik
    Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:43-58 [Conf]
  5. Volker Diekert, Manfred Kufleitner
    A Remark about Quadratic Trace Equations. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:59-66 [Conf]
  6. Jarkko Kari
    Infinite Snake Tiling Problems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:67-77 [Conf]
  7. Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza
    Decision Problems for Linear and Circular Splicing Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:78-92 [Conf]
  8. Karl Svozil
    Finite Automata Models of Quantized Systems: Conceptual Status and Outlook. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:93-102 [Conf]
  9. Véronique Bruyère, Olivier Carton
    Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:103-115 [Conf]
  10. Mark Daley, Lila Kari
    Some Properties of Ciliate Bio-operations. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:116-127 [Conf]
  11. Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel
    On the Descriptional Complexity of Some Variants of Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:128-139 [Conf]
  12. Hendrik Jan Hoogeboom
    Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:140-151 [Conf]
  13. Henry N. Adorna
    On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:152-161 [Conf]
  14. Markus Holzer, Martin Kutrib
    Unary Language Operations and Their Nondeterministic State Complexity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:162-172 [Conf]
  15. Julien Cassaigne
    Constructing Infinite Words of Intermediate Complexity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:173-184 [Conf]
  16. Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang
    A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:185-196 [Conf]
  17. Jirí Srba
    Undecidability of Weak Bisimilarity for PA-Processes. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:197-208 [Conf]
  18. Michael Domaratzki
    Improved Bounds on the Number of Automata Accepting Finite Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:209-219 [Conf]
  19. Sándor Horváth, Peter Leupold, Gerhard Lischke
    Roots and Powers of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:220-230 [Conf]
  20. Jürgen Giesl, Aart Middeldorp
    Innermost Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:231-244 [Conf]
  21. S. Stepán Holub
    A Unique Structure of Two-Generated Binary Equality Sets. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:245-257 [Conf]
  22. Markus Holzer, Barbara König
    On Deterministic Finite Automata and Syntactic Monoid Size. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:258-269 [Conf]
  23. Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov
    An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:270-282 [Conf]
  24. Kostyantyn Archangelsky
    Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma*-Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:283-289 [Conf]
  25. Balázs Imreh
    Some Remarks on Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:290-296 [Conf]
  26. Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle
    Tiling Systems over Infinite Pictures and Their Acceptance Conditions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:297-306 [Conf]
  27. Frédérique Bassino, Julien Clément, Cyril Nicaud
    The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:307-318 [Conf]
  28. James D. Currie, D. Sean Fitzpatrick
    Circular Words Avoiding Patterns. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:319-325 [Conf]
  29. Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun
    Safety Verification for Two-Way Finite Automata with Monotonic Counters. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:326-338 [Conf]
  30. Hiroshi Umeo, Naoki Kamikawa
    An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:339-348 [Conf]
  31. László Kászonyi
    On the Structure of Graphic DLI-Sets. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:349-356 [Conf]
  32. Nguyen Huong Lam
    Finite Completion of Comma-Free Codes. Part I. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:357-368 [Conf]
  33. Do Long Van, Igor Litovsky
    On a Family of Codes with Bounded Deciphering Delay. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:369-380 [Conf]
  34. Tanguy Urvoy
    Abstract Families of Graphs. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:381-392 [Conf]
  35. Alexander Okhotin
    Automaton Representation of Linear Conjunctive Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:393-404 [Conf]
  36. Christiane Frougny
    On-Line Odometers for Two-Sided Symbolic Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:405-416 [Conf]
  37. Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic
    Characteristic Semigroups of Directable Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:417-427 [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