The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexandru Mateescu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pál Dömösi, Alexandru Mateescu
    On Slender Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Recent Topics in Mathematical and Computational Linguistics, 2000, pp:97-103 [Conf]
  2. Manfred Kudlek, Alexandru Mateescu
    On Mix Operation. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:430-439 [Conf]
  3. Alexandru Mateescu
    Algebraic Aspects of Parikh Matrices. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:170-180 [Conf]
  4. Alexandru Mateescu
    On (Left) Partial Shuffle. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:264-278 [Conf]
  5. Alexandru Mateescu, George Daniel Mateescu
    Associative Shuffle of Infinite Words. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:291-307 [Conf]
  6. Alexandru Mateescu, George Daniel Mateescu
    Fair and Associative Infinite Trajectories. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:327-338 [Conf]
  7. 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]
  8. Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa
    Syntactic and Semantic Aspects of Parallelism. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:79-105 [Conf]
  9. Alexandru Mateescu, Arto Salomaa
    Nondeterministic Trajectories. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:96-106 [Conf]
  10. Carlos Martín-Vide, Alexandru Mateescu
    Contextual grammars with trajectories. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:362-374 [Conf]
  11. Manfred Kudlek, Alexandru Mateescu
    Rational and Algebraic Languages with Distributed Catenation. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:129-138 [Conf]
  12. Manfred Kudlek, Alexandru Mateescu
    Distributed Catenation and Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:313-322 [Conf]
  13. Manfred Kudlek, Solomon Marcus, Alexandru Mateescu
    Contextual Grammars with Distributed Catenation and Shuffle. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:269-280 [Conf]
  14. Carlos Martín-Vide, Alexandru Mateescu
    Sewing Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:398-408 [Conf]
  15. Alexandru Mateescu
    On Scattered Syntactic Monoids. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:386-395 [Conf]
  16. Tero Harju, Alexandru Mateescu, Arto Salomaa
    Shuffle on Trajectories: The Schützenberger Product and Related Operations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:503-511 [Conf]
  17. Alexandru Mateescu, Arto Salomaa
    Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:174-184 [Conf]
  18. Alexandru Mateescu, Arto Salomaa
    Nondeterminism in Patterns. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:661-668 [Conf]
  19. Alexandru Mateescu
    Shuffle of omega-Words: Algebraic Aspects (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:150-160 [Conf]
  20. Alexandru Mateescu, Arto Salomaa
    On Simplest Possible Solutions for Post Correspondence Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:5, pp:441-457 [Journal]
  21. Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa
    Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1992, v:10, n:4, pp:243-254 [Journal]
  22. Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
    On Representing RE Languages by One-Sided Internal Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:3, pp:217-234 [Journal]
  23. Alexandru Mateescu
    CD Grammar Systems and Trajectories. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1997, v:13, n:2, pp:141-158 [Journal]
  24. Alexandru Mateescu, Gheorghe Paun
    On fully initial grammars with regulated rewriting. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1989, v:9, n:2, pp:157-165 [Journal]
  25. Alexandru Mateescu, Arto Salomaa, Sheng Yu
    Factorizations of Languages and Commutativity Conditions. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2002, v:15, n:3, pp:339-351 [Journal]
  26. Alexandru Mateescu
    Special Families of Matrix Languages and Decidable Problems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1991, v:10, n:1-2, pp:45-52 [Journal]
  27. Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun
    Gramars with Oracles. [Citation Graph (0, 0)][DBLP]
    Sci. Ann. Cuza Univ., 1993, v:2, n:, pp:3-12 [Journal]
  28. Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
    Simple Splicing Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:145-163 [Journal]
  29. Carlos Martín-Vide, Alexandru Mateescu
    Contextual Generalized Sequential Machines. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:72, n:, pp:159-168 [Journal]
  30. Carlos Martín-Vide, Alexandru Mateescu, Gheorghe Paun
    Hybrid Grammars: The Chomsky-Marcus Case. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:64, n:, pp:- [Journal]
  31. Alexandru Mateescu
    The Splendour of an Old Ballad: Aad van Wijngaarden Grammars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:49, n:, pp:130-142 [Journal]
  32. Alexandru Mateescu
    Words on Trajectories. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:65, n:, pp:118-135 [Journal]
  33. Alexandru Mateescu, Arto Salomaa
    Views on Linguistics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1996, v:58, n:, pp:- [Journal]
  34. Alexandru Mateescu, Arto Salomaa
    Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:68, n:, pp:134-150 [Journal]
  35. Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu
    On the Injectivity of the Parikh Matrix Mapping. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:49, n:4, pp:289-299 [Journal]
  36. Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun
    Deletion Sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:3/4, pp:355-370 [Journal]
  37. Manfred Kudlek, Alexandru Mateescu
    Algebraic, Linear and Rational Languages Defined by Mix Operation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:33, n:3, pp:249-264 [Journal]
  38. Erzsébet Csuhaj-Varjú, Alexandru Mateescu
    On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:37-50 [Journal]
  39. Alexandru Mateescu, Rudolf Freund
    Routes and Products of Monoids. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:205-211 [Journal]
  40. Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
    P, NP and the Post Correspondence Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:2, pp:135-142 [Journal]
  41. Carlos Martín-Vide, Alexandru Mateescu, Victor Mitrana
    Parallel Finite Automata Systems Communicating by States. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:733-749 [Journal]
  42. Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa
    Geometric Transformations on Language Families: The Power of Symmetry. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:1, pp:1-0 [Journal]
  43. Alexandru Mateescu, Arto Salomaa
    Matrix Indicators For Subword Occurrences And Ambiguity. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:277-292 [Journal]
  44. Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa
    On Parallel Deletions Applied to a Word. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:2, pp:129-144 [Journal]
  45. Alexandru Mateescu, Arto Salomaa
    PCP-Prime Words and Primality Types. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:1, pp:57-70 [Journal]
  46. Alexandru Mateescu, Arto Salomaa
    Finite Degrees of Ambiguity in Pattern Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:233-253 [Journal]
  47. Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
    A sharpening of the Parikh mapping. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:551-564 [Journal]
  48. Carlos Martín-Vide, Alexandru Mateescu
    Special Families of Sewing Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:3, pp:279-286 [Journal]
  49. Alexandru Mateescu, Kai Salomaa, Sheng Yu
    On Fairness of Many-Dimensional Trajectories. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:2, pp:145-158 [Journal]
  50. Jonathan S. Golan, Alexandru Mateescu, Dragos Vaida
    Semirings and Parallel Composition of Processes. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:3, pp:199-218 [Journal]
  51. Alexandru Mateescu, Arto Salomaa, Sheng Yu
    Subword histories and Parikh matrices. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:1, pp:1-21 [Journal]
  52. Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu
    Codifiable Languages and the Parikh Matrix Mapping. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:8, pp:783-793 [Journal]
  53. Alexandru Mateescu
    J.UCS Special Issue on Formal Languages and Automata. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:9, pp:493- [Journal]
  54. Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
    Parikh Prime Words and GO-like Territories. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1995, v:1, n:12, pp:790-810 [Journal]
  55. Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
    Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1995, v:1, n:5, pp:292-311 [Journal]
  56. Tero Harju, Marjo Lipponen, Alexandru Mateescu
    Flatwords and Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:93-108 [Journal]
  57. Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa
    Multi-Pattern Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:253-268 [Journal]
  58. Manfred Kudlek, Alexandru Mateescu
    On Distributed Catenation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:341-352 [Journal]
  59. Alexandru Mateescu
    Scattered Deletion and Commutativity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:2, pp:361-371 [Journal]
  60. Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa
    Shuffle on Trajectories: Syntactic Constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:1-56 [Journal]

  61. Infinite trajectories. [Citation Graph (, )][DBLP]


  62. Decidability of fairness for context-free languages. [Citation Graph (, )][DBLP]


Search in 0.114secs, Finished in 0.117secs
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