The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sheng Yu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lucian Ilie, Gonzalo Navarro, Sheng Yu
    On NFA Reductions. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:112-124 [Conf]
  2. Kai Salomaa, Derick Wood, Sheng Yu
    Rediscovering Pushdown Machines. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:372-385 [Conf]
  3. Kai Salomaa, Sheng Yu
    Rewriting Rules for Synchronization Languages. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:322-338 [Conf]
  4. Kai Salomaa, Sheng Yu
    Synchronization Expressions: Characterization Results and Implementation. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:45-56 [Conf]
  5. Lucian Ilie, Sheng Yu, Kaizhong Zhang
    Repetition Complexity of Words. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:320-329 [Conf]
  6. Lucian Ilie, Roberto Solis-Oba, Sheng Yu
    Reducing the Size of NFAs by Using Equivalences and Preorders. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:310-321 [Conf]
  7. Lucian Ilie, Sheng Yu
    Constructing NFA s by Optimal Use of Positions in Regular Expressions. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:279-288 [Conf]
  8. Michael Domaratzki, Jeffrey Shallit, Sheng Yu
    Minimal Covers of Formal Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:319-329 [Conf]
  9. Kai Salomaa, Sheng Yu
    Nondeterminism Degrees for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:154-165 [Conf]
  10. Arto Salomaa, Sheng Yu
    On the decomposition of finite languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:22-31 [Conf]
  11. Nicolae Santean, Sheng Yu
    On Weakly Ambiguous Finite Transducers. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:156-167 [Conf]
  12. Kai Salomaa, Derick Wood, Sheng Yu
    Structural Equivalences and ET0L Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:430-439 [Conf]
  13. Kai Salomaa, Sheng Yu
    Degrees of Nondeterminism for Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:380-389 [Conf]
  14. Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
    Inclusion is Undecidable for Pattern Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:301-312 [Conf]
  15. Sheng Yu, Qingyu Zhuang, Kai Salomaa
    Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:100-104 [Conf]
  16. Karel Culik II, Sheng Yu
    Translation of Systolic Algorithms between Systems of Different Topology. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:756-763 [Conf]
  17. Lila Kari, Greg Gloor, Sheng Yu
    Using DNA to solve the Bounded Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    MCU (1), 1998, pp:51-65 [Conf]
  18. Lucian Ilie, Sheng Yu
    Algorithms for Computing Small NFAs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:328-340 [Conf]
  19. Kai Salomaa, Derick Wood, Sheng Yu
    Complexity of E0L Structural Equivalence. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:587-596 [Conf]
  20. Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit
    Characterizing Regular Languages with Polynomial Densities. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:494-503 [Conf]
  21. R. Govindarajan, Sheng Yu
    Data Flow Implementation of Generalized Guarded Commands. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:372-389 [Conf]
  22. Lucian Ilie, Sheng Yu, Qing Zhao
    Introduction to Process Traces. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:1706-1712 [Conf]
  23. Sheng Yu, Qing Zhao
    Process Traces With the Option Operation. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:750-755 [Conf]
  24. Haitong Xu, Sheng Yu
    Adding States into Object Types. [Citation Graph (0, 0)][DBLP]
    PLC, 2005, pp:101-107 [Conf]
  25. Lucian Ilie, Baozhen Shan, Sheng Yu
    Fast Algorithms for Extended Regular Expression Matching and Searching. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:179-190 [Conf]
  26. Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu
    Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:69-81 [Conf]
  27. Cristian Calude, Kai Salomaa, Sheng Yu
    Metric Lexical Analysis. [Citation Graph (0, 0)][DBLP]
    WIA, 1999, pp:48-59 [Conf]
  28. Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu
    State Complexity of Basic Operations on Finite Languages. [Citation Graph (0, 0)][DBLP]
    WIA, 1999, pp:60-70 [Conf]
  29. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    Regex and Extended Regex. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:77-84 [Conf]
  30. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    Minimal Cover-Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:43-56 [Conf]
  31. Sheng Yu
    On the State Complexity of Combined Operations. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:11-22 [Conf]
  32. Andrei Paun, Nicolae Santean, Sheng Yu
    An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:243-251 [Conf]
  33. Kai Salomaa, Xiuming Wu, Sheng Yu
    Efficient Implementation of Regular Languages Using R-AFA. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1997, pp:176-184 [Conf]
  34. Kai Salomaa, Sheng Yu
    NFA to DFA Transformation for Finite Languages. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1996, pp:149-158 [Conf]
  35. Xiangfeng Luo, Ning Fang, Weimin Xu, Sheng Yu, Kai Yan, Huizhe Xiao
    Experiments Study for Scientific Texts Domain Keyword Acquisition. [Citation Graph (0, 0)][DBLP]
    SKG, 2006, pp:45- [Conf]
  36. Jin Ma, Sheng Yu
    Practical Rules for Reduction on the Number of States of a State Diagram. [Citation Graph (0, 0)][DBLP]
    TOOLS (26), 1998, pp:46-0 [Conf]
  37. Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu
    Tree-systems of morphisms. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:38, n:2, pp:131-153 [Journal]
  38. Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu
    DNA Computing, Sticker Systems, and Universality. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:5, pp:401-420 [Journal]
  39. Stavros Konstantinidis, Nicolae Santean, Sheng Yu
    Representation and uniformization of algebraic transductions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:43, n:6, pp:395-417 [Journal]
  40. 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]
  41. Kai Salomaa, Sheng Yu
    Generalized Fairness and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1999, v:14, n:1, pp:193-204 [Journal]
  42. Cristian Calude, Sheng Yu
    Language-theoretic Complexity of Disjunctive Sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:203-209 [Journal]
  43. Per Enflo, Andrew Granville, Jeffrey Shallit, Sheng Yu
    on Sparse Languages L such that LL = Sigma. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:3, pp:275-285 [Journal]
  44. Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu
    On the robustness of primitive words. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:239-252 [Journal]
  45. Efim B. Kinber, Arto Salomaa, Sheng Yu
    On the equivalence of grammars inferred from derivation. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1986, v:29, n:, pp:39-45 [Journal]
  46. Arto Salomaa, Kai Salomaa, Sheng Yu
    Primary Types of Instances of the Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:44, n:, pp:226-241 [Journal]
  47. Kai Salomaa, Sheng Yu
    Morphisms and rational tranducers. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:50, n:, pp:186-193 [Journal]
  48. Sheng Yu
    State Complexity of Finite and Infinite Regular Languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:142-152 [Journal]
  49. Helmut Jürgensen, Kai Salomaa, Sheng Yu
    Decidability of the Intercode Property. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1993, v:29, n:6, pp:375-380 [Journal]
  50. L. Guo, Kai Salomaa, Sheng Yu
    On Synchronization Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:423-436 [Journal]
  51. Gheorghe Paun, Sheng Yu
    On Synchronization in P Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:4, pp:397-410 [Journal]
  52. Nicolae Santean, Sheng Yu
    Nondeterministic Bimachines and Rational Relations with Finite Codomain. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:237-264 [Journal]
  53. Stavros Konstantinidis, Nicolae Santean, Sheng Yu
    Fuzzification of Rational and Recognizable Sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:76, n:4, pp:413-447 [Journal]
  54. Lucian Ilie, Sheng Yu
    Follow automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:140-162 [Journal]
  55. 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]
  56. Arto Salomaa, Sheng Yu
    Subword conditions and subword histories. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:12, pp:1741-1755 [Journal]
  57. Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu
    Towards a DNA Solution to the Shortest Common Superstring Problem. [Citation Graph (0, 0)][DBLP]
    International Journal on Artificial Intelligence Tools, 1999, v:8, n:4, pp:385-400 [Journal]
  58. Cezar Câmpeanu, Andrei Paun, Sheng Yu
    An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:83-97 [Journal]
  59. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    A Formal Study Of Practical Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1007-1018 [Journal]
  60. Lucian Ilie, Sheng Yu, Kaizhong Zhang
    Word Complexity And Repetitions In Words. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:41-55 [Journal]
  61. Kai Salomaa, Sheng Yu
    Preface. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:399-401 [Journal]
  62. Sheng Yu
    Implementation and Application of Automata - Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:1-3 [Journal]
  63. Cezar Câmpeanu, Sheng Yu
    Pattern expressions and pattern automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:6, pp:267-274 [Journal]
  64. Kai Salomaa, Sheng Yu
    The Immortality Problem for LAG Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:6, pp:311-315 [Journal]
  65. 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]
  66. Kai Salomaa, Derick Wood, Sheng Yu
    Pumping and Pushdown Machines. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:221-232 [Journal]
  67. Kai Salomaa, Derick Wood, Sheng Yu
    Complexity of E0L Structural Equivalence. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:6, pp:471-485 [Journal]
  68. Markus Holzer, Kai Salomaa, Sheng Yu
    On the State Complexity of k-Entry Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:453-466 [Journal]
  69. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:3, pp:303-310 [Journal]
  70. Sheng Yu
    State Complexity of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:2, pp:221-0 [Journal]
  71. 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]
  72. Kai Salomaa, Sheng Yu
    NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1997, v:2, n:3, pp:177-186 [Journal]
  73. Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
    Decision Problems for Patterns. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:53-63 [Journal]
  74. 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]
  75. Kai Salomaa, Sheng Yu
    Measures of Nondeterminism for Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:362-374 [Journal]
  76. Cristian Calude, Kai Salomaa, Sheng Yu
    Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:117-118 [Journal]
  77. Cristian Calude, Kai Salomaa, Sheng Yu
    Additive Distances and Quasi-Distances Between Words. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:141-152 [Journal]
  78. 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]
  79. Kai Salomaa, Sheng Yu
    Synchronization Expressions and Languages. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:9, pp:610-621 [Journal]
  80. Karel Culik II, Jan K. Pachl, Sheng Yu
    On the Limit Sets of Cellular Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:831-842 [Journal]
  81. Sheng Yu
    Class-is-type is inadequate for object reuse. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 2001, v:36, n:6, pp:50-59 [Journal]
  82. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    Minimal cover-automata for finite languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:3-16 [Journal]
  83. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
    Mergible states in large NFA. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:23-34 [Journal]
  84. Karel Culik II, Sheng Yu
    Iterative Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:227-247 [Journal]
  85. Karel Culik II, Sheng Yu
    Real-Time, Pseudo Real-Time, and Linear-Time ITA. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:15-26 [Journal]
  86. Lucian Ilie, Sheng Yu
    Reducing NFAs by invariant equivalences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:373-390 [Journal]
  87. Helmut Jürgensen, Kai Salomaa, Sheng Yu
    Transducers and the Decidability of Independence in Free Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:107-117 [Journal]
  88. Lila Kari, Greg Gloor, Sheng Yu
    Using DNA to solve the Bounded Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:2, pp:193-203 [Journal]
  89. Kai Salomaa, Xiuming Wu, Sheng Yu
    Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:1, pp:103-111 [Journal]
  90. Arto Salomaa, Derick Wood, Sheng Yu
    On the state complexity of reversals of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:315-329 [Journal]
  91. Kai Salomaa, Derick Wood, Sheng Yu
    Structural Equivalence and ET0L Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:123-140 [Journal]
  92. Kai Salomaa, Sheng Yu
    Alternating finite automata and star-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:167-176 [Journal]
  93. Kai Salomaa, Sheng Yu
    Decidability of EDT0L structural equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:245-259 [Journal]
  94. Kai Salomaa, Sheng Yu
    Decidability of Structural Equivalence of E0L Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:131-139 [Journal]
  95. Kai Salomaa, Sheng Yu
    Synchronization Expressions with Extended Join Operation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:1, pp:73-88 [Journal]
  96. Sheng Yu, Qingyu Zhuang, Kai Salomaa
    The State Complexities of Some Basic Operations on Regular Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:2, pp:315-328 [Journal]
  97. Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu
    On the existence of prime decompositions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:60-69 [Journal]
  98. Kai Salomaa, Sheng Yu, Jinfeng Zan
    Deterministic Caterpillar Expressions. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:97-108 [Conf]
  99. Sheng Yu
    State Complexity: Recent Results and Open Problems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:471-480 [Journal]
  100. Arto Salomaa, Kai Salomaa, Sheng Yu
    State complexity of combined operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:2-3, pp:140-152 [Journal]

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


  102. Are Statecharts Finite Automata?. [Citation Graph (, )][DBLP]


  103. Length Codes, Products of Languages and Primality. [Citation Graph (, )][DBLP]


  104. State Complexity of Combined Operations for Prefix-Free Regular Languages. [Citation Graph (, )][DBLP]


  105. Experimental study on the extraction and distribution of textual domain keywords. [Citation Graph (, )][DBLP]


  106. Hierarchy and equivalence of multi-letter quantum finite automata [Citation Graph (, )][DBLP]


  107. State Complexity Approximation [Citation Graph (, )][DBLP]


  108. State complexity of union and intersection combined with star and reversal [Citation Graph (, )][DBLP]


  109. State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation [Citation Graph (, )][DBLP]


  110. State Complexity of Catenation Combined with Star and Reversal [Citation Graph (, )][DBLP]


  111. Transition Complexity of Incomplete DFAs [Citation Graph (, )][DBLP]


  112. Cellular automata, omegaomega-regular sets, and sofic systems. [Citation Graph (, )][DBLP]


  113. Can the catenation of two weakly sparse languages be dense? [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
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