The SCEAS System
Navigation Menu

Search the dblp DataBase


Artur Jez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Artur Jez, Alexander Okhotin
    Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:168-181 [Conf]
  2. Artur Jez
    Conjunctive Grammars Can Generate Non-regular Unary Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:242-253 [Conf]

  3. One-Nonterminal Conjunctive Grammars over a Unary Alphabet. [Citation Graph (, )][DBLP]

  4. Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. [Citation Graph (, )][DBLP]

  5. On the Computational Completeness of Equations over Sets of Natural Numbers. [Citation Graph (, )][DBLP]

  6. Hyper-minimisation Made Efficient. [Citation Graph (, )][DBLP]

  7. Least and Greatest Solutions of Equations over Sets of Integers. [Citation Graph (, )][DBLP]

  8. Collecting weighted items from a dynamic queue. [Citation Graph (, )][DBLP]

  9. Equations over Sets of Natural Numbers with Addition Only. [Citation Graph (, )][DBLP]

  10. Complexity of solutions of equations over sets of natural numbers. [Citation Graph (, )][DBLP]

  11. On Equations over Sets of Integers. [Citation Graph (, )][DBLP]

  12. Generalized Whac-a-Mole [Citation Graph (, )][DBLP]

  13. Optimal, online validation of the pi and pi' failure functions [Citation Graph (, )][DBLP]

  14. On equations over sets of integers [Citation Graph (, )][DBLP]

  15. Graphical complexity of products of permutation groups. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002