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