The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pál Dömösi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pál Dömösi
    On Complete Classes of Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:69-79 [Conf]
  2. 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]
  3. Pál Dömösi, Carlos Martín-Vide, Victor Mitrana
    Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:60-67 [Conf]
  4. Pál Dömösi, Zoltán Ésik, Balázs Imreh
    On Product Hierarchies of Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:137-144 [Conf]
  5. Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura
    Formal Languages Consisting of Primitive Words. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:194-203 [Conf]
  6. Pál Dömösi, Manfred Kudlek
    Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:226-233 [Conf]
  7. Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
    Homomorphic Realizations of Automata with Compositions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:299-307 [Conf]
  8. Pál Dömösi
    Unusual Algorithms for Lexicographical Enumeration. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2000, v:14, n:3, pp:461-468 [Journal]
  9. Pál Dömösi
    On the semigroup of automaton mappings with finite alphabet. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1972, v:1, n:, pp:251-254 [Journal]
  10. Pál Dömösi
    On superpositions of automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1976, v:2, n:, pp:335-343 [Journal]
  11. Pál Dömösi
    On minimal R-complete systems of finite automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1977, v:3, n:, pp:37-41 [Journal]
  12. Pál Dömösi
    On homomorphically alphai-complete systems of automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1983, v:6, n:, pp:85-88 [Journal]
  13. Pál Dömösi, Zoltán Ésik
    On the hiearchy of nui-product. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1988, v:8, n:, pp:253-257 [Journal]
  14. Pál Dömösi, Zoltán Ésik
    On homomorphic simulation of automata by alphai-producst. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1988, v:8, n:, pp:315-323 [Journal]
  15. Pál Dömösi, Zoltán Ésik
    Product hierarchies of automata and homomorphic simulation. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1990, v:9, n:4, pp:371-373 [Journal]
  16. Pál Dömösi, Balázs Imreh
    On nui-products of automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1983, v:6, n:, pp:149-162 [Journal]
  17. Pál Dömösi, Chrystopher L. Nehaniv
    Complete Finite Automata Network Graphs with Minimal Number of Edges. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1999, v:14, n:1, pp:37-50 [Journal]
  18. Pál Dömösi, Satoshi Okawa
    A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2001, v:15, n:1, pp:25-32 [Journal]
  19. Pál Dömösi, Géza Horváth
    The Language of Primitive Words in not Regular: Two Simple Proofs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:191-194 [Journal]
  20. Pál Dömösi, Satoshi Okawa, Sadaki Hirose
    A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:68, n:, pp:151- [Journal]
  21. Pál Dömösi, Manfred Kudlek
    New Iteration Lemmata for Regular Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:151-157 [Journal]
  22. Pál Dömösi, Zoltán Ésik
    Homomorphic Simulation and Letichevsky's Criterion. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:427-436 [Journal]
  23. Pál Dömösi, Zoltán Ésik
    Critical Classes for the alpha_0-Product. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:17-24 [Journal]
  24. Pál Dömösi, Géza Horváth
    Alternative proof of the Lyndon-Schützenberger Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:3, pp:194-198 [Journal]
  25. Pál Dömösi, Chrystopher L. Nehaniv
    On complete systems of automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:1, pp:27-54 [Journal]
  26. Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes
    Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:295-317 [Journal]
  27. Zoltán Ésik, Pál Dömösi
    Complete Classes of Automata for the alpha-0-Product. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:1-14 [Journal]

  28. Automata Networks without any Letichevsky Criteria. [Citation Graph (, )][DBLP]


  29. Parsing by Simple Insertion Systems. [Citation Graph (, )][DBLP]


  30. Marcus contextual languages consisting of primitive words. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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