Andrzej Ehrenfeucht

196 papers A* 15B 6C 8Journal 140Unranked 21

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Evolving reaction systems. Theor. Comput. Sci. Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg
2017	—	`conf`	Reaction Systems: A Model of Computation Inspired by the Functioning of the Living Cell. The Role of Theory in Computer Science Andrzej Ehrenfeucht, Ion Petre, Grzegorz Rozenberg
2015	J	`jnl`	Standard and ordered zoom structures. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2014	J	`jnl`	Zoom Structures and reaction Systems Yield Exploration Systems. Int. J. Found. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2013	—	`conf`	Processes Inspired by the Functioning of Living Cells: Natural Computing Approach - (Abstract). UCNC Andrzej Ehrenfeucht, Grzegorz Rozenberg
2013	C	`conf`	Processes Inspired by the Functioning of Living Cells: Natural Computing Approach. CiE Andrzej Ehrenfeucht, Grzegorz Rozenberg
2012	C	`conf`	A Formal Framework for Processes Inspired by the Functioning of Living Cells. CIAA Andrzej Ehrenfeucht, Grzegorz Rozenberg
2012	J	`jnl`	Minimal Reaction Systems. Trans. Comp. Sys. Biology Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg
2012	—	`conf`	Relevance of Entities in Reaction Systems. Languages Alive Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg
2012	—	`conf`	Representing Reaction Systems by Trees. Computation, Physics and Beyond Robert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg
2012	J	`jnl`	Stability and Chaos in reaction Systems. Int. J. Found. Comput. Sci. Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg, Allison Thompson Brown
2011	C	`conf`	A Formal Framework for Bioprocesses in Living Cells. UC Andrzej Ehrenfeucht, Grzegorz Rozenberg
2011	J	`jnl`	A Tour of reaction Systems. Int. J. Found. Comput. Sci. Robert Brijder, Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg
2011	J	`jnl`	Functions Defined by Reaction Systems. Int. J. Found. Comput. Sci. Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg
2011	J	`jnl`	Position heaps: A simple and dynamic text indexing data structure. J. Discrete Algorithms Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo
2011	—	`conf`	Reaction Systems with Duration. Computation, Cooperation, and Life Robert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg
2010	J	`jnl`	A Note on Causalities in Reaction Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Robert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg
2010	J	`jnl`	Combinatorics of Life and Death for Reaction Systems. Int. J. Found. Comput. Sci. Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg
2010	C	`conf`	Reaction Systems: A Model of Computation Inspired by Biochemistry. Developments in Language Theory Andrzej Ehrenfeucht, Grzegorz Rozenberg
2010	J	`jnl`	Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2009	—	`conf`	Computational Nature of Processes Induced by Biochemical Reactions. Workshop on Membrane Computing Andrzej Ehrenfeucht, Grzegorz Rozenberg
2009	B	`conf`	Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. CPM Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo
2009	J	`jnl`	Introducing time in reaction systems. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2008	B	`conf`	Modeling Interactions between Biochemical Reactions. Petri Nets Andrzej Ehrenfeucht, Grzegorz Rozenberg
2007	C	`conf`	Biochemical Reactions as Computations. CiE Andrzej Ehrenfeucht, Grzegorz Rozenberg
2007	J	`jnl`	Events and modules in reaction systems. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2007	J	`jnl`	Finite metrics in switching classes. Discret. Appl. Math. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2007	J	`jnl`	Reaction Systems. Fundam. Informaticae Andrzej Ehrenfeucht, Grzegorz Rozenberg
2006	C	`conf`	Computational Nature of Biochemical Reactions. Developments in Language Theory Andrzej Ehrenfeucht, Grzegorz Rozenberg
2006	J	`jnl`	Covers from Templates. Int. J. Found. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2006	J	`jnl`	Embedding linear orders in grids. Acta Informatica Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2006	J	`jnl`	The Embedding Problem for Switching Classes of Graphs. Fundam. Informaticae Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
2006	J	`jnl`	Zdzislaw Pawlak (1926-2006). Bull. EATCS Andrzej Ehrenfeucht, James F. Peters, Grzegorz Rozenberg, Andrzej Skowron
2004	C	`conf`	Basic Notions of Reaction Systems. Developments in Language Theory Andrzej Ehrenfeucht, Grzegorz Rozenberg
2004	B	`conf`	Embedding in Switching Classes with Skew Gains. ICGT Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
2004	—	`ch.`	String Searching. Handbook of Data Structures and Applications Andrzej Ehrenfeucht, Ross M. McConnell
2004	J	`jnl`	Transitivity of local complementation and switching on graphs. Discret. Math. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2003	J	`jnl`	Forbidding-enforcing systems. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
2003	J	`jnl`	Formal systems for gene assembly in ciliates. Theor. Comput. Sci. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg
2002	J	`jnl`	Characterizing the Micronuclear Gene Patterns in Ciliates. Theory Comput. Syst. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
2002	J	`jnl`	Gene assembly through cyclic graph decomposition. Theor. Comput. Sci. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2002	J	`jnl`	String and Graph Reduction Systems for Gene Assembly in Ciliates. Math. Struct. Comput. Sci. Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg
2001	—	`conf`	Circularity and Other Invariants of Gene Assembly in Ciliates. Words, Semigroups, and Transductions Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg
2001	B	`conf`	Patterns of Micronuclear Genes in ciliates. DNA Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
2001	J	`jnl`	Sequences of languages in forbidding-enforcing families. Soft Comput. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt
2001	—	`conf`	Universal and simple operations for gene assembly in ciliates. Where Mathematics, Computer Science, Linguistics and Biology Meet Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg
2000	J	`jnl`	Pancyclicity in switching classes. Inf. Process. Lett. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
1999	—	`conf`	Forbidding and enforcing. DNA Based Computers Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt
1999	—	`book`	The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1998	—	`conf`	Complexity Issues in Switching of Graphs. TAGT Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
1998	J	`jnl`	On Representing Recursively Enumerable Languages by Internal Contextual Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg
1998	J	`jnl`	Permutations, parenthesis words, and Schröder numbers. Discret. Math. Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg
1997	—	`ch.`	2-Structures - A Framework For Decomposition And Transformation Of Graphs. Handbook of Graph Grammars Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1997	—	`ch.`	Contextual Grammars and Formal Languages. Handbook of Formal Languages (2) Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg
1997	J	`jnl`	Invariants of Inversive 2-Structures on Groups of Labels. Math. Struct. Comput. Sci. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1997	J	`jnl`	Semantics of Nonsequential Tree-Based Computation Schemes. Fundam. Informaticae Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa
1996	J	`jnl`	A Note on Binary Grammatical Codes of Trees. Theor. Comput. Sci. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
1996	—	`conf`	A browsing system based on mul timedia cohesion. WebNet Jim Jungbauer, Patricia Baggett, Andrzej Ehrenfeucht
1996	J	`jnl`	Finite Languages for the Representation of Finite Graphs. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
1996	—	`conf`	Forbidding, Enforcing. DMTCS Andrzej Ehrenfeucht, Grzegorz Rozenberg
1996	J	`jnl`	On Representing RE Languages by One-Sided Internal Contextual Languages. Acta Cybern. Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
1996	J	`jnl`	The Linear Landscape of External Contextual Languages. Acta Informatica Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg
1995	J	`jnl`	Grammatical Codes of Trees and Terminally Coded Grammars. Fundam. Informaticae Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg
1995	J	`jnl`	The size of k-pseudotrees. Discret. Math. Emanuel Knill, Andrzej Ehrenfeucht, David Haussler
1995	A*	`conf`	Theory of 2-Structures. ICALP Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1994	J	`jnl`	A k-Structure Generalization of the Theory of 2-Structures. Theor. Comput. Sci. Andrzej Ehrenfeucht, Ross M. McConnell
1994	J	`jnl`	An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
1994	J	`jnl`	Clans and Regions in 2-Structures. Theor. Comput. Sci. André H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg
1994	J	`jnl`	Combinatorial Properties of Dependence Graphs Inf. Comput. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1994	J	`jnl`	Context-free Text Grammars. Acta Informatica Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
1994	—	`conf`	Dynamic Labeled 2-Structures with Variable Domains. Results and Trends in Theoretical Computer Science Andrzej Ehrenfeucht, Grzegorz Rozenberg
1994	J	`jnl`	Dynamic Labeled 2-Structures. Math. Struct. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1994	—	`conf`	Group Based Graph Transformations and Hierarchical Representations of Graphs. TAGT Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1994	J	`jnl`	Hyperedge Channels are Abelian. Theor. Comput. Sci. André H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg
1994	J	`jnl`	Incremental construction of 2-structures. Discret. Math. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1994	—	`ch.`	Normal Forms for Contextual Grammars. Mathematical Aspects of Natural and Formal Languages Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg
1994	J	`jnl`	Properties of Grammatical Codes of Trees. Theor. Comput. Sci. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
1994	J	`jnl`	Semantics of Trees. Math. Syst. Theory Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa
1994	J	`jnl`	Square Systems. Fundam. Informaticae Andrzej Ehrenfeucht, Grzegorz Rozenberg
1993	C	`conf`	An Introduction to Context-free Text Grammars. Developments in Language Theory Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Paulien ten Pas, Grzegorz Rozenberg
1993	B	`conf`	An Introduction to Dynamic Labled 2-Structures. MFCS Andrzej Ehrenfeucht, Grzegorz Rozenberg
1993	J	`jnl`	Combinatorial Properties of Texts. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
1993	J	`jnl`	Efficient Detection of Quasiperiodicities in Strings. Theor. Comput. Sci. Alberto Apostolico, Andrzej Ehrenfeucht
1993	J	`jnl`	On the Structure of Recognizable Languages of Dependence Graphs. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1993	J	`jnl`	T-structures, T-functions, and texts. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1992	J	`jnl`	A representation of partial Boolean algebras. Fundam. Informaticae Andrzej Ehrenfeucht, Marek W. Zawadowski
1992	J	`jnl`	Angular 2-Structures. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1991	J	`jnl`	Grammatical codes of trees. Discret. Appl. Math. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1990	J	`jnl`	A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions. Acta Informatica Andrzej Ehrenfeucht, Grzegorz Rozenberg
1990	J	`jnl`	Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem. Acta Informatica Andrzej Ehrenfeucht, Grzegorz Rozenberg
1990	J	`jnl`	Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems. Acta Informatica Andrzej Ehrenfeucht, Grzegorz Rozenberg
1990	J	`jnl`	Primitivity is Hereditary for 2-Structures. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1990	J	`jnl`	Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1990	J	`jnl`	Theory of 2-Structures, Part II: Representation Through Labeled Tree Families. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1989	J	`jnl`	A General Lower Bound on the Number of Examples Needed for Learning Inf. Comput. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
1989	J	`jnl`	Average sizes of suffix trees and DAWGs. Discret. Appl. Math. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler
1989	—	`ch.`	Clans and the Complexity of Dependence graphs. A Perspective in Theoretical Computer Science Andrzej Ehrenfeucht, Grzegorz Rozenberg
1989	J	`jnl`	Learnability and the Vapnik-Chervonenkis dimension. J. ACM Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
1989	J	`jnl`	Learning Decision Trees from Random Examples Inf. Comput. Andrzej Ehrenfeucht, David Haussler
1988	A*	`conf`	A General Lower Bound on the Number of Examples Needed for Learning. COLT Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
1988	J	`jnl`	A new distance metric on strings computable in linear time. Discret. Appl. Math. Andrzej Ehrenfeucht, David Haussler
1988	A*	`conf`	Learning Decision Trees from Random Examples. COLT Andrzej Ehrenfeucht, David Haussler
1988	J	`jnl`	Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata. Acta Informatica Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1988	—	`conf`	Textual and visual access to a computer by people who know nothing about it. SIGDOC Patricia Baggett, Andrzej Ehrenfeucht
1987	J	`jnl`	Complete inverted files for efficient text retrieval and analysis. J. ACM Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht
1987	J	`jnl`	Occam's Razor. Inf. Process. Lett. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
1986	J	`jnl`	Addendum to the paper "On the dependence of functions on their variables". J. Comb. Theory A Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski
1986	A*	`conf`	Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract) STOC Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth
1986	J	`jnl`	Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1986	J	`jnl`	Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1986	J	`jnl`	Each Regular Code Is Included in A Maximal Regular Code. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1986	J	`jnl`	On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. Theor. Comput. Sci. Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1986	J	`jnl`	On the membership problem for regular DNLC grammars. Discret. Appl. Math. IJsbrand Jan Aalbersberg, Grzegorz Rozenberg, Andrzej Ehrenfeucht
1985	J	`jnl`	A Combinatorial Property of EOL Languages. Math. Syst. Theory Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
1985	J	`jnl`	A morphic representation of EOL languages and other ETOL languages. Discret. Appl. Math. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen
1985	J	`jnl`	Adding Global Forbidding Context to Context-Free Grammars. Theor. Comput. Sci. Andrzej Ehrenfeucht, H. C. M. Kleijn, Grzegorz Rozenberg
1985	A*	`conf`	On Total Regulators Generated by Derivation Relations. ICALP Walter Bucher, Andrzej Ehrenfeucht, David Haussler
1985	J	`jnl`	On Total Regulators Generated by Derivation Relations. Theor. Comput. Sci. Walter Bucher, Andrzej Ehrenfeucht, David Haussler
1985	B	`conf`	On coordinated rewriting. FCT Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
1985	J	`jnl`	Strong Iterative Pairs and The Regularity of Context-Free Languages. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1985	J	`jnl`	The Smallest Automaton Recognizing the Subwords of a Text. Theor. Comput. Sci. Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas
1984	J	`jnl`	A new method of proving theorems on chromatic index. Discret. Math. Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead
1984	J	`jnl`	An Easy Proof of Greibach Normal Form Inf. Control. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1984	A*	`conf`	Building a Complete Inverted File for a Set of Text Files in Linear Time STOC Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
1984	A*	`conf`	Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. ICALP Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
1984	J	`jnl`	On Ambiguity in Dos Systems. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
1984	J	`jnl`	On Inherently Ambiguous E0L Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
1984	J	`jnl`	On regularity of languages generated by copying systems. Discret. Appl. Math. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1984	J	`jnl`	Restrictions on NLC Graph Grammars. Theor. Comput. Sci. Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg
1983	J	`jnl`	Context Free Normal Systems and ETOL Systems. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
1983	J	`jnl`	Linear size finite automata for the set of all subwords of a word - an outline of results. Bull. EATCS Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
1983	J	`jnl`	On Regularity of Context-Free Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
1983	J	`jnl`	On the Separating Power of Eol Systems. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1983	J	`jnl`	On the Subword Complexity of Locally Catenative D0L Languages. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1983	J	`jnl`	On the Subword Complexity of m-Free D0L Languages. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1983	J	`jnl`	Repetition of Subwords in DOL Languages Inf. Control. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1982	J	`jnl`	Basic formulas and languages: PART II.Applications to E0L systems and forms. Discret. Appl. Math. Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
1982	J	`jnl`	Compositional complexity of Boolean functions. Discret. Appl. Math. Harold Abelson, Andrzej Ehrenfeucht, James Fickett, Jan Mycielski
1982	A*	`conf`	Conditions Enforcing Regularity of Context-Free Languages. ICALP Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
1982	J	`jnl`	On Subword Complexities of Homomorphic Images of Languages. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1982	J	`jnl`	On the Dependence of Functions on Their Variables. J. Comb. Theory A Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski
1982	A*	`conf`	Repetitions in Homomorphisms and Languages. ICALP Andrzej Ehrenfeucht, Grzegorz Rozenberg
1982	J	`jnl`	Representation Theorems Using DOS Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1982	J	`jnl`	The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. Theor. Comput. Sci. Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg
1981	J	`jnl`	A Morphic Representation of Complements of Recursively Enumerable Sets. J. ACM Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen
1981	J	`jnl`	Basic formulas and languages Part I. The theory. Discret. Appl. Math. Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
1981	J	`jnl`	FPOL Systems Generating Counting Languages. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1981	J	`jnl`	On ET0L Systems with Finite Tree-Rank. SIAM J. Comput. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir
1981	A*	`conf`	On the (Generalized) Post Correspondence Problem with Lists of Length 2. ICALP Andrzej Ehrenfeucht, Grzegorz Rozenberg
1981	—	`conf`	On the Subword Complexity and Square-Freeness of Formal Languages. Theoretical Computer Science Andrzej Ehrenfeucht, Grzegorz Rozenberg
1981	J	`jnl`	On the Subword Complexity of D0L Languages with a Constant Distribution. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1981	J	`jnl`	On the Subword Complexity of Square-Free D0L Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1981	J	`jnl`	Pumping Lemmas for Regular Sets. SIAM J. Comput. Andrzej Ehrenfeucht, Rohit Parikh, Grzegorz Rozenberg
1980	J	`jnl`	Continuous Grammars Inf. Control. Andrzej Ehrenfeucht, Hermann A. Maurer, Grzegorz Rozenberg
1980	A*	`conf`	DOS Systems and Languages. ICALP Andrzej Ehrenfeucht, Grzegorz Rozenberg
1980	J	`jnl`	Every Two Equivalent D0L Systems have a Regular True Envelope. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1980	J	`jnl`	Many-to-one simulation in E0L forms is decidable. Discret. Appl. Math. Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
1980	J	`jnl`	On Ambiguity in E0L Systems. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1980	J	`jnl`	On Basic Properties of DOS Systems and Languages Inf. Control. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1980	J	`jnl`	On a Bound for the D0L Sequence Equivalence Problem. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1980	J	`jnl`	On the Emptiness of the Intersection of Two D0S Languages Problem. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1980	J	`jnl`	The Sequence Equivalence Problem is Decidable for 0S Systems. J. ACM Andrzej Ehrenfeucht, Grzegorz Rozenberg
1979	J	`jnl`	An Observation on Scattered Grammars. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1979	J	`jnl`	Finding a Homomorphism Between Two Words is NP-Complete. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1979	J	`jnl`	On ET0L Systems with Rank. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir
1979	J	`jnl`	On k-Stable Functions. J. Comb. Theory A Andrzej Ehrenfeucht, Jan Mycielski
1979	J	`jnl`	Periodicity and unbordered segments of words. Discret. Math. Andrzej Ehrenfeucht, D. M. Silberger
1978	J	`jnl`	A note on DOL length sets. Discret. Math. Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg
1978	J	`jnl`	E0L Languages are not Codings of FP0L Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1978	J	`jnl`	Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1978	J	`jnl`	On the Structure of Derivations in Deterministic ET0L Systems. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1978	J	`jnl`	Simplifications of Homomorphisms Inf. Control. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1977	J	`jnl`	On Some Context Free Languages That Are Not Deterministic ETOL Languages. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1976	J	`jnl`	A Relationship between ET0L and EDT0L Languages. Theor. Comput. Sci. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum
1976	J	`jnl`	Complexity Measures for Regular Expressions. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, H. Paul Zeiger
1976	J	`jnl`	On Proving that Certain Languages are not ETOL. Acta Informatica Andrzej Ehrenfeucht, Grzegorz Rozenberg
1976	J	`jnl`	On the number of subwords of everywhere growing DTOL languages. Discret. Math. Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg
1975	J	`jnl`	A Pumping Theorem for Deterministic Etol Languages. RAIRO Theor. Informatics Appl. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1975	A*	`conf`	On (Un)predictability of Formal Languages (Extended Abstract) STOC Andrzej Ehrenfeucht, Grzegorz Rozenberg
1975	—	`conf`	On Inverse Homomorphic Images of Deterministic ET0L Languages. Automata, Languages, Development Andrzej Ehrenfeucht, Grzegorz Rozenberg
1975	A*	`conf`	On the (Combinatorial) Structure of L Languages without Interactions STOC Andrzej Ehrenfeucht, Grzegorz Rozenberg
1975	—	`conf`	On Θ-Determined E0L Languages. Automata, Languages, Development Andrzej Ehrenfeucht, Grzegorz Rozenberg
1975	J	`jnl`	Practical Decidability. J. Comput. Syst. Sci. Andrzej Ehrenfeucht
1975	J	`jnl`	Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. Theor. Comput. Sci. Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg
1975	J	`jnl`	Subword complexities of various classes of deterministic developmental languages with interactions. Int. J. Parallel Program. Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg
1974	A*	`conf`	Complexity Measures for Regular Expressions STOC Andrzej Ehrenfeucht, H. Paul Zeiger
1974	—	`conf`	D0L Systems With Rank. L Systems Andrzej Ehrenfeucht, Grzegorz Rozenberg
1974	—	`conf`	Generatively Deterministic L Languages. Subword Point of View. L Systems Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg
1974	J	`jnl`	Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. Acta Informatica Andrzej Ehrenfeucht, Grzegorz Rozenberg
1974	J	`jnl`	On Families of Intersecting Sets. J. Comb. Theory A Andrzej Ehrenfeucht, Jan Mycielski
1974	J	`jnl`	The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages Inf. Control. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1974	—	`conf`	Three Useful Results Concerning L Languages Without Interactions. L Systems Andrzej Ehrenfeucht, Grzegorz Rozenberg
1974	A*	`conf`	Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. ICALP Andrzej Ehrenfeucht, Grzegorz Rozenberg
1973	J	`jnl`	A Limit Theorem for Sets of Subwords in Deterministic T0L Languages. Inf. Process. Lett. Andrzej Ehrenfeucht, Grzegorz Rozenberg
1973	J	`jnl`	Discernible Elements in Models for Peano Arithmetic. J. Symb. Log. Andrzej Ehrenfeucht
1957	J	`jnl`	Two Theories with Axioms Built by Means of Pleonasms. J. Symb. Log. Andrzej Ehrenfeucht