The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andrzej Ehrenfeucht: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
    Learnability and the Vapnik-Chervonenkis dimension. [Citation Graph (6, 0)][DBLP]
    J. ACM, 1989, v:36, n:4, pp:929-965 [Journal]
  2. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
    Occam's Razor. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:6, pp:377-380 [Journal]
  3. Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht
    Complete inverted files for efficient text retrieval and analysis. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:578-595 [Journal]
  4. Andrzej Ehrenfeucht, H. Paul Zeiger
    Complexity Measures for Regular Expressions. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:134-146 [Journal]
  5. Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg
    Generatively Deterministic L Languages. Subword Point of View. [Citation Graph (0, 0)][DBLP]
    L Systems, 1974, pp:93-103 [Conf]
  6. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Three Useful Results Concerning L Languages Without Interactions. [Citation Graph (0, 0)][DBLP]
    L Systems, 1974, pp:72-77 [Conf]
  7. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    D0L Systems With Rank. [Citation Graph (0, 0)][DBLP]
    L Systems, 1974, pp:136-141 [Conf]
  8. Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg
    Circularity and Other Invariants of Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:81-97 [Conf]
  9. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Dynamic Labeled 2-Structures with Variable Domains. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:97-123 [Conf]
  10. Andrzej Ehrenfeucht, David Haussler
    Learning Decision Trees from Random Examples. [Citation Graph (0, 0)][DBLP]
    COLT, 1988, pp:182-194 [Conf]
  11. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
    A General Lower Bound on the Number of Examples Needed for Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1988, pp:139-154 [Conf]
  12. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Paulien ten Pas, Grzegorz Rozenberg
    An Introduction to Context-free Text Grammars. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:357-369 [Conf]
  13. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Basic Notions of Reaction Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:27-29 [Conf]
  14. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Computational Nature of Biochemical Reactions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:36- [Conf]
  15. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
    Patterns of Micronuclear Genes in ciliates. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:279-289 [Conf]
  16. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    On coordinated rewriting. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:100-111 [Conf]
  17. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    2-Structures - A Framework For Decomposition And Transformation Of Graphs. [Citation Graph (0, 0)][DBLP]
    Handbook of Graph Grammars, 1997, pp:401-478 [Conf]
  18. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Embedding in Switching Classes with Skew Gains. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:257-270 [Conf]
  19. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:109-118 [Conf]
  20. Walter Bucher, Andrzej Ehrenfeucht, David Haussler
    On Total Regulators Generated by Derivation Relations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:71-79 [Conf]
  21. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
    Conditions Enforcing Regularity of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:187-191 [Conf]
  22. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Theory of 2-Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:1-14 [Conf]
  23. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:473-480 [Conf]
  24. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    DOS Systems and Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:134-141 [Conf]
  25. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the (Generalized) Post Correspondence Problem with Lists of Length 2. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:408-416 [Conf]
  26. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Repetitions in Homomorphisms and Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:192-211 [Conf]
  27. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    An Introduction to Dynamic Labled 2-Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:156-173 [Conf]
  28. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Building a Complete Inverted File for a Set of Text Files in Linear Time [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:349-358 [Conf]
  29. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
    Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:273-282 [Conf]
  30. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On (Un)predictability of Formal Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:117-120 [Conf]
  31. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the (Combinatorial) Structure of L Languages without Interactions [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:137-144 [Conf]
  32. Andrzej Ehrenfeucht, H. Paul Zeiger
    Complexity Measures for Regular Expressions [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:75-79 [Conf]
  33. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Complexity Issues in Switching of Graphs. [Citation Graph (0, 0)][DBLP]
    TAGT, 1998, pp:59-70 [Conf]
  34. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Group Based Graph Transformations and Hierarchical Representations of Graphs. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:502-520 [Conf]
  35. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity and Square-Freeness of Formal Languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:1-4 [Conf]
  36. Jim Jungbauer, Patricia Baggett, Andrzej Ehrenfeucht
    A browsing system based on mul timedia cohesion. [Citation Graph (0, 0)][DBLP]
    WebNet, 1996, pp:- [Conf]
  37. Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg
    The Linear Landscape of External Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:6, pp:571-593 [Journal]
  38. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1974, v:3, n:, pp:265-283 [Journal]
  39. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On Proving that Certain Languages are not ETOL. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:407-415 [Journal]
  40. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:27, n:4, pp:315-342 [Journal]
  41. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:27, n:4, pp:343-368 [Journal]
  42. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1990, v:28, n:1, pp:83-94 [Journal]
  43. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Embedding linear orders in grids. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:42, n:6-7, pp:419-428 [Journal]
  44. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
    Context-free Text Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:2, pp:161-206 [Journal]
  45. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:25, n:2, pp:203-231 [Journal]
  46. 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]
  47. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Finite metrics in switching classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:1, pp:68-73 [Journal]
  48. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Transitivity of local complementation and switching on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:45-60 [Journal]
  49. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Linear size finite automata for the set of all subwords of a word - an outline of results. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1983, v:21, n:, pp:12-20 [Journal]
  50. Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg
    Grammatical Codes of Trees and Terminally Coded Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:23, n:1, pp:1-32 [Journal]
  51. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Square Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:20, n:1/2/3, pp:75-111 [Journal]
  52. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa
    Semantics of Nonsequential Tree-Based Computation Schemes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:29, n:4, pp:305-324 [Journal]
  53. Andrzej Ehrenfeucht, Marek W. Zawadowski
    A representation of partial Boolean algebras. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:16, n:3-4, pp:349-353 [Journal]
  54. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    The Embedding Problem for Switching Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:1, pp:115-134 [Journal]
  55. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Reaction Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:75, n:1-4, pp:263-280 [Journal]
  56. Andrzej Ehrenfeucht, David Haussler
    Learning Decision Trees from Random Examples [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:3, pp:231-246 [Journal]
  57. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
    A General Lower Bound on the Number of Examples Needed for Learning [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:3, pp:247-261 [Journal]
  58. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    Combinatorial Properties of Dependence Graphs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:114, n:2, pp:315-328 [Journal]
  59. Andrzej Ehrenfeucht, Hermann A. Maurer, Grzegorz Rozenberg
    Continuous Grammars [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:46, n:1, pp:71-91 [Journal]
  60. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1974, v:26, n:3, pp:256-271 [Journal]
  61. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Simplifications of Homomorphisms [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:38, n:3, pp:298-309 [Journal]
  62. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On Basic Properties of DOS Systems and Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:47, n:2, pp:137-153 [Journal]
  63. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Repetition of Subwords in DOL Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:59, n:1-3, pp:13-35 [Journal]
  64. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    An Easy Proof of Greibach Normal Form [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:3, pp:190-199 [Journal]
  65. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Covers from Templates. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:2, pp:475-488 [Journal]
  66. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Pancyclicity in switching classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:153-156 [Journal]
  67. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    A Limit Theorem for Sets of Subwords in Deterministic T0L Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:3, pp:70-73 [Journal]
  68. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    An Observation on Scattered Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:84-85 [Journal]
  69. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Finding a Homomorphism Between Two Words is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:86-88 [Journal]
  70. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Emptiness of the Intersection of Two D0S Languages Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:223-225 [Journal]
  71. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity of D0L Languages with a Constant Distribution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:3, pp:108-113 [Journal]
  72. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity of Locally Catenative D0L Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:7-9 [Journal]
  73. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity of m-Free D0L Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:3, pp:121-124 [Journal]
  74. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
    On Ambiguity in Dos Systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1984, v:18, n:3, pp:279-295 [Journal]
  75. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:4, pp:405-424 [Journal]
  76. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:4, pp:425-439 [Journal]
  77. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    On the Structure of Recognizable Languages of Dependence Graphs. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:1, pp:7-22 [Journal]
  78. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
    Combinatorial Properties of Texts. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:5, pp:433-464 [Journal]
  79. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    A Pumping Theorem for Deterministic Etol Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1975, v:9, n:2, pp:13-12 [Journal]
  80. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On Some Context Free Languages That Are Not Deterministic ETOL Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1977, v:11, n:4, pp:273-291 [Journal]
  81. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    FPOL Systems Generating Counting Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1981, v:15, n:2, pp:161-173 [Journal]
  82. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On Subword Complexities of Homomorphic Images of Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1982, v:16, n:4, pp:303-316 [Journal]
  83. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Separating Power of Eol Systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1983, v:17, n:1, pp:13-22 [Journal]
  84. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Strong Iterative Pairs and The Regularity of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1985, v:19, n:1, pp:43-56 [Journal]
  85. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Each Regular Code Is Included in A Maximal Regular Code. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:1, pp:89-96 [Journal]
  86. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    The Sequence Equivalence Problem is Decidable for 0S Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:656-663 [Journal]
  87. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen
    A Morphic Representation of Complements of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:706-714 [Journal]
  88. Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
    An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:283-294 [Journal]
  89. Andrzej Ehrenfeucht
    Practical Decidability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:11, n:3, pp:392-396 [Journal]
  90. Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
    Context Free Normal Systems and ETOL Systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:1, pp:34-46 [Journal]
  91. Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
    Finite Languages for the Representation of Finite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:170-184 [Journal]
  92. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Structure of Derivations in Deterministic ET0L Systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:17, n:3, pp:331-347 [Journal]
  93. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir
    On ET0L Systems with Rank. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:3, pp:237-255 [Journal]
  94. Andrzej Ehrenfeucht, Jan Mycielski
    On Families of Intersecting Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:2, pp:259-260 [Journal]
  95. Andrzej Ehrenfeucht, Jan Mycielski
    On k-Stable Functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:282-288 [Journal]
  96. Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski
    On the Dependence of Functions on Their Variables. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:1, pp:106-108 [Journal]
  97. Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski
    Addendum to the paper "On the dependence of functions on their variables". [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:2, pp:317- [Journal]
  98. Andrzej Ehrenfeucht
    Two Theories with Axioms Built by Means of Pleonasms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1957, v:22, n:1, pp:36-38 [Journal]
  99. Andrzej Ehrenfeucht
    Discernible Elements in Models for Peano Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:2, pp:291-292 [Journal]
  100. Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg
    String and Graph Reduction Systems for Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:2, pp:113-134 [Journal]
  101. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Invariants of Inversive 2-Structures on Groups of Labels. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:4, pp:303-327 [Journal]
  102. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Dynamic Labeled 2-Structures. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1994, v:4, n:4, pp:433-455 [Journal]
  103. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
    Characterizing the Micronuclear Gene Patterns in Ciliates. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:5, pp:501-519 [Journal]
  104. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa
    Semantics of Trees. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:2, pp:159-181 [Journal]
  105. Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
    A Combinatorial Property of EOL Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1985, v:18, n:3, pp:207-235 [Journal]
  106. Andrzej Ehrenfeucht, Rohit Parikh, Grzegorz Rozenberg
    Pumping Lemmas for Regular Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:536-541 [Journal]
  107. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir
    On ET0L Systems with Finite Tree-Rank. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:40-58 [Journal]
  108. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt
    Sequences of languages in forbidding-enforcing families. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2001, v:5, n:2, pp:121-125 [Journal]
  109. Alberto Apostolico, Andrzej Ehrenfeucht
    Efficient Detection of Quasiperiodicities in Strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:119, n:2, pp:247-265 [Journal]
  110. Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas
    The Smallest Automaton Recognizing the Subwords of a Text. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:31-55 [Journal]
  111. Walter Bucher, Andrzej Ehrenfeucht, David Haussler
    On Total Regulators Generated by Derivation Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:131-148 [Journal]
  112. A. H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Hyperedge Channels are Abelian. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:2, pp:387-393 [Journal]
  113. A. H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Clans and Regions in 2-Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:129, n:2, pp:207-262 [Journal]
  114. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg
    Formal systems for gene assembly in ciliates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:199-219 [Journal]
  115. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Gene assembly through cyclic graph decomposition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:325-349 [Journal]
  116. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
    On Regularity of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:311-332 [Journal]
  117. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
    On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:201-228 [Journal]
  118. Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg
    The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:119-144 [Journal]
  119. Andrzej Ehrenfeucht, H. C. M. Kleijn, Grzegorz Rozenberg
    Adding Global Forbidding Context to Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:37, n:, pp:337-360 [Journal]
  120. Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg
    Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:1, pp:59-75 [Journal]
  121. Andrzej Ehrenfeucht, Ross M. McConnell
    A k-Structure Generalization of the Theory of 2-Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:209-227 [Journal]
  122. Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg
    Restrictions on NLC Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:211-223 [Journal]
  123. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
    Properties of Grammatical Codes of Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:125, n:2, pp:259-293 [Journal]
  124. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
    A Note on Binary Grammatical Codes of Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:425-438 [Journal]
  125. Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg
    On Representing Recursively Enumerable Languages by Internal Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:61-83 [Journal]
  126. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Forbidding-enforcing systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:611-638 [Journal]
  127. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    E0L Languages are not Codings of FP0L Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:6, n:, pp:327-341 [Journal]
  128. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:169-183 [Journal]
  129. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Every Two Equivalent D0L Systems have a Regular True Envelope. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:45-52 [Journal]
  130. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On Ambiguity in E0L Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:127-134 [Journal]
  131. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On a Bound for the D0L Sequence Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:339-342 [Journal]
  132. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity of Square-Free D0L Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:25-32 [Journal]
  133. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Representation Theorems Using DOS Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:75-90 [Journal]
  134. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:3, pp:277-303 [Journal]
  135. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Theory of 2-Structures, Part II: Representation Through Labeled Tree Families. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:3, pp:305-342 [Journal]
  136. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Primitivity is Hereditary for 2-Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:3, pp:343-358 [Journal]
  137. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Angular 2-Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:227-248 [Journal]
  138. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum
    A Relationship between ET0L and EDT0L Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:1, n:4, pp:325-330 [Journal]
  139. Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
    On Inherently Ambiguous E0L Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:28, n:, pp:197-214 [Journal]
  140. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Events and modules in reaction systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:3-16 [Journal]
  141. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Biochemical Reactions as Computations. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:672-673 [Conf]
  142. Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead
    A new method of proving theorems on chromatic index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:159-164 [Journal]
  143. Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg
    Permutations, parenthesis words, and Schröder numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:259-264 [Journal]
  144. Emanuel Knill, Andrzej Ehrenfeucht, David Haussler
    The size of k-pseudotrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:185-194 [Journal]
  145. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Incremental construction of 2-structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:113-141 [Journal]

  146. Modeling Interactions between Biochemical Reactions. [Citation Graph (, )][DBLP]


  147. Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. [Citation Graph (, )][DBLP]


  148. Reaction Systems: A Model of Computation Inspired by Biochemistry. [Citation Graph (, )][DBLP]


  149. Computational Nature of Processes Induced by Biochemical Reactions. [Citation Graph (, )][DBLP]


  150. Grammatical codes of trees. [Citation Graph (, )][DBLP]


  151. A new distance metric on strings computable in linear time. [Citation Graph (, )][DBLP]


  152. Average sizes of suffix trees and DAWGs. [Citation Graph (, )][DBLP]


Search in 0.663secs, Finished in 0.667secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002