The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Okhotin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Okhotin
    Language Equations with Symmetric Difference. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:292-303 [Conf]
  2. Alexander Okhotin
    Automaton Representation of Linear Conjunctive Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:393-404 [Conf]
  3. Alexander Okhotin
    Boolean Grammars. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:398-410 [Conf]
  4. Alexander Okhotin
    LR Parsing for Boolean Grammars. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:362-373 [Conf]
  5. Alexander Okhotin, Oksana Yakimova
    Language Equations with Complementation. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:420-432 [Conf]
  6. Juhani Karhumäki, Michal Kunc, Alexander Okhotin
    Communication of Two Stacks and Rewriting. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:468-479 [Conf]
  7. Alexander Okhotin
    Decision Problems for Language Equations with Boolean Operations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:239-251 [Conf]
  8. Alexander Okhotin
    On Computational Universality in Language Equations. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:292-303 [Conf]
  9. Alexander Okhotin
    The Dual of Concatenation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:698-710 [Conf]
  10. Alexander Okhotin
    Strict Language Inequalities and Their Decision Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:708-719 [Conf]
  11. Alexander Okhotin
    Efficient Automaton-Based Recognition for Linear Conjunctive Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:169-181 [Conf]
  12. Alexander Okhotin
    Whale Calf, a Parser Generator for Conjunctive Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:213-220 [Conf]
  13. Alexander Okhotin
    An overview of conjunctive grammars, Formal Language Theory Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:79, n:, pp:145-163 [Journal]
  14. Alexander Okhotin, Kai Salomaa, Michael Domaratzki
    One-Visit Caterpillar Tree Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:52, n:4, pp:361-375 [Journal]
  15. Alexander Okhotin
    Computational Universality in One-variable Language Equations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:4, pp:563-578 [Journal]
  16. Alexander Okhotin
    Top-Down Parsing of Conjunctive Languages. [Citation Graph (0, 0)][DBLP]
    Grammars, 2002, v:5, n:1, pp:21-40 [Journal]
  17. Alexander Okhotin
    LR Parsing for Conjunctive Grammars. [Citation Graph (0, 0)][DBLP]
    Grammars, 2002, v:5, n:2, pp:81-124 [Journal]
  18. Alexander Okhotin
    Boolean grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:1, pp:19-48 [Journal]
  19. Alexander Okhotin
    Efficient Automaton-Based Recognition For Linear Conjunctive Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1103-1116 [Journal]
  20. Alexander Okhotin
    A characterization of the arithmetical hierarchy by language equations. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:985-998 [Journal]
  21. Alexander Okhotin
    Generalized Lr Parsing Algorithm for Boolean Grammars. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:629-664 [Journal]
  22. Alexander Okhotin
    The hardest linear conjunctive language. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:247-253 [Journal]
  23. Alexander Okhotin
    Conjunctive Grammars. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:519-535 [Journal]
  24. Alexander Okhotin
    Conjunctive Grammars and Systems of Language Equations. [Citation Graph (0, 0)][DBLP]
    Programming and Computer Software, 2002, v:28, n:5, pp:243-249 [Journal]
  25. Michael Domaratzki, Alexander Okhotin
    Representing recursively enumerable languages by iterated deletion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:3, pp:451-457 [Journal]
  26. Juhani Karhumäki, Michal Kunc, Alexander Okhotin
    Computing by commuting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:200-211 [Journal]
  27. Alexander Okhotin
    A recognition and parsing algorithm for arbitrary conjunctive grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:365-399 [Journal]
  28. Alexander Okhotin
    On the closure properties of linear conjunctive languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:663-685 [Journal]
  29. Alexander Okhotin
    On the number of nonterminals in linear conjunctive grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:419-448 [Journal]
  30. Alexander Okhotin
    The dual of concatenation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:425-447 [Journal]
  31. Alexander Okhotin
    Unresolved systems of language equations: Expressive power and decision problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:283-308 [Journal]
  32. Alexander Okhotin, Oksana Yakimova
    Language equations with complementation: Decision problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:112-126 [Journal]
  33. 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]
  34. Alexander Okhotin
    Expressive Power of LL(k) Boolean Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:446-457 [Conf]
  35. Alexander Okhotin
    A Simple P-Complete Problem and Its Representations by Language Equations. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:267-278 [Conf]
  36. Alexander Okhotin
    Recursive descent parsing for Boolean grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:44, n:3-4, pp:167-189 [Journal]
  37. Alexander Okhotin, Kai Salomaa
    Contextual Grammars with Uniform Sets of Trajectories. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:341-351 [Journal]

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


  39. On the State Complexity of Operations on Two-Way Finite Automata. [Citation Graph (, )][DBLP]


  40. On Equations over Sets of Numbers and Their Limitations. [Citation Graph (, )][DBLP]


  41. Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. [Citation Graph (, )][DBLP]


  42. On Language Equations XXK = XXL and XM = N over a Unary Alphabet. [Citation Graph (, )][DBLP]


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


  44. On the expressive power of univariate equations over sets of natural numbers. [Citation Graph (, )][DBLP]


  45. On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. [Citation Graph (, )][DBLP]


  46. Unambiguous Finite Automata over a Unary Alphabet. [Citation Graph (, )][DBLP]


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


  48. Conjunctive Grammars with Restricted Disjunction. [Citation Graph (, )][DBLP]


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


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


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


  52. Representing a P-complete problem by small trellis automata [Citation Graph (, )][DBLP]


  53. Nondeterministic State Complexity of Positional Addition [Citation Graph (, )][DBLP]


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


Search in 0.097secs, Finished in 0.100secs
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