default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Ehrenfeucht
Person information
- affiliation: University of Colorado, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j140]Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg:
Evolving reaction systems. Theor. Comput. Sci. 682: 79-99 (2017)- [c50]Andrzej Ehrenfeucht, Ion Petre
, Grzegorz Rozenberg:
Reaction Systems: A Model of Computation Inspired by the Functioning of the Living Cell. The Role of Theory in Computer Science 2017: 1-32 - 2015
- [j139]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Standard and ordered zoom structures. Theor. Comput. Sci. 608: 4-15 (2015) - 2014
- [j138]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Zoom Structures and reaction Systems Yield Exploration Systems. Int. J. Found. Comput. Sci. 25(3): 275-306 (2014) - 2013
- [c49]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach. CiE 2013: 120-122 - [c48]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach - (Abstract). UCNC 2013: 3-5 - 2012
- [j137]Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg, Allison Thompson Brown:
Stability and Chaos in reaction Systems. Int. J. Found. Comput. Sci. 23(5): 1173- (2012) - [j136]Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg:
Minimal Reaction Systems. Trans. Comp. Sys. Biology 14: 102-122 (2012) - [c47]Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg:
Relevance of Entities in Reaction Systems. Languages Alive 2012: 44-55 - [c46]Robert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Representing Reaction Systems by Trees. Computation, Physics and Beyond 2012: 330-342 - [c45]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Formal Framework for Processes Inspired by the Functioning of Living Cells. CIAA 2012: 25-27 - 2011
- [j135]Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
Functions Defined by Reaction Systems. Int. J. Found. Comput. Sci. 22(1): 167-178 (2011) - [j134]Robert Brijder, Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
A Tour of reaction Systems. Int. J. Found. Comput. Sci. 22(7): 1499-1517 (2011) - [j133]Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo:
Position heaps: A simple and dynamic text indexing data structure. J. Discrete Algorithms 9(1): 100-121 (2011) - [c44]Robert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Reaction Systems with Duration. Computation, Cooperation, and Life 2011: 191-202 - [c43]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Formal Framework for Bioprocesses in Living Cells. UC 2011: 10 - 2010
- [j132]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j131]Robert Brijder, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Note on Causalities in Reaction Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 30 (2010) - [j130]Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
Combinatorics of Life and Death for Reaction Systems. Int. J. Found. Comput. Sci. 21(3): 345-356 (2010) - [c42]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Reaction Systems: A Model of Computation Inspired by Biochemistry. Developments in Language Theory 2010: 1-3
2000 – 2009
- 2009
- [j129]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Introducing time in reaction systems. Theor. Comput. Sci. 410(4-5): 310-322 (2009) - [c41]Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo:
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. CPM 2009: 41-53 - [c40]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Computational Nature of Processes Induced by Biochemical Reactions. Workshop on Membrane Computing 2009: 16-17 - 2008
- [c39]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Modeling Interactions between Biochemical Reactions. Petri Nets 2008: 7 - 2007
- [j128]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Finite metrics in switching classes. Discret. Appl. Math. 155(1): 68-73 (2007) - [j127]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Reaction Systems. Fundam. Informaticae 75(1-4): 263-280 (2007) - [j126]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Events and modules in reaction systems. Theor. Comput. Sci. 376(1-2): 3-16 (2007) - [c38]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Biochemical Reactions as Computations. CiE 2007: 672-673 - 2006
- [j125]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Embedding linear orders in grids. Acta Informatica 42(6-7): 419-428 (2006) - [j124]Andrzej Ehrenfeucht, James F. Peters, Grzegorz Rozenberg, Andrzej Skowron:
Zdzislaw Pawlak (1926-2006). Bull. EATCS 90: 202-204 (2006) - [j123]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
The Embedding Problem for Switching Classes of Graphs. Fundam. Informaticae 74(1): 115-134 (2006) - [j122]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Covers from Templates. Int. J. Found. Comput. Sci. 17(2): 475-488 (2006) - [c37]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Computational Nature of Biochemical Reactions. Developments in Language Theory 2006: 36 - 2004
- [j121]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Transitivity of local complementation and switching on graphs. Discret. Math. 278(1-3): 45-60 (2004) - [c36]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Basic Notions of Reaction Systems. Developments in Language Theory 2004: 27-29 - [c35]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Embedding in Switching Classes with Skew Gains. ICGT 2004: 257-270 - [r1]Andrzej Ehrenfeucht, Ross M. McConnell:
String Searching. Handbook of Data Structures and Applications 2004 - 2003
- [j120]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) - [j119]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Forbidding-enforcing systems. Theor. Comput. Sci. 292(3): 611-638 (2003) - 2002
- [j118]Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg:
String and Graph Reduction Systems for Gene Assembly in Ciliates. Math. Struct. Comput. Sci. 12(2): 113-134 (2002) - [j117]Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg:
Characterizing the Micronuclear Gene Patterns in Ciliates. Theory Comput. Syst. 35(5): 501-519 (2002) - [j116]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Gene assembly through cyclic graph decomposition. Theor. Comput. Sci. 281(1-2): 325-349 (2002) - 2001
- [j115]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt:
Sequences of languages in forbidding-enforcing families. Soft Comput. 5(2): 121-125 (2001) - [c34]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 - [c33]Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg:
Universal and simple operations for gene assembly in ciliates. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 329-342 - [c32]Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg:
Patterns of Micronuclear Genes in ciliates. DNA 2001: 279-289 - 2000
- [j114]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Pancyclicity in switching classes. Inf. Process. Lett. 73(5-6): 153-156 (2000)
1990 – 1999
- 1999
- [b1]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs. World Scientific 1999, ISBN 978-981-02-4042-4, pp. I-XVI, 1-290 - [c31]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt:
Forbidding and enforcing. DNA Based Computers 1999: 195-206 - 1998
- [j113]Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg:
Permutations, parenthesis words, and Schröder numbers. Discret. Math. 190(1-3): 259-264 (1998) - [j112]Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg:
On Representing Recursively Enumerable Languages by Internal Contextual Languages. Theor. Comput. Sci. 205(1-2): 61-83 (1998) - [c30]Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Complexity Issues in Switching of Graphs. TAGT 1998: 59-70 - 1997
- [j111]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa:
Semantics of Nonsequential Tree-Based Computation Schemes. Fundam. Informaticae 29(4): 305-324 (1997) - [j110]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Invariants of Inversive 2-Structures on Groups of Labels. Math. Struct. Comput. Sci. 7(4): 303-327 (1997) - [p4]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
2-Structures - A Framework For Decomposition And Transformation Of Graphs. Handbook of Graph Grammars 1997: 401-478 - [p3]Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg:
Contextual Grammars and Formal Languages. Handbook of Formal Languages (2) 1997: 237-293 - 1996
- [j109]Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg:
The Linear Landscape of External Contextual Languages. Acta Informatica 33(6): 571-593 (1996) - [j108]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-233 (1996) - [j107]Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg:
Finite Languages for the Representation of Finite Graphs. J. Comput. Syst. Sci. 52(1): 170-184 (1996) - [j106]Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
A Note on Binary Grammatical Codes of Trees. Theor. Comput. Sci. 155(2): 425-438 (1996) - [c29]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Forbidding, Enforcing. DMTCS 1996: 37-37 - [c28]Jim Jungbauer, Patricia Baggett, Andrzej Ehrenfeucht:
A browsing system based on mul timedia cohesion. WebNet 1996 - 1995
- [j105]Emanuel Knill, Andrzej Ehrenfeucht, David Haussler:
The size of k-pseudotrees. Discret. Math. 141(1-3): 185-194 (1995) - [j104]Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg:
Grammatical Codes of Trees and Terminally Coded Grammars. Fundam. Informaticae 23(1): 1-32 (1995) - [c27]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Theory of 2-Structures. ICALP 1995: 1-14 - 1994
- [j103]Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
Context-free Text Grammars. Acta Informatica 31(2): 161-206 (1994) - [j102]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Incremental construction of 2-structures. Discret. Math. 128(1-3): 113-141 (1994) - [j101]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Square Systems. Fundam. Informaticae 20(1/2/3): 75-111 (1994) - [j100]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Combinatorial Properties of Dependence Graphs. Inf. Comput. 114(2): 315-328 (1994) - [j99]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) - [j98]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Dynamic Labeled 2-Structures. Math. Struct. Comput. Sci. 4(4): 433-455 (1994) - [j97]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa:
Semantics of Trees. Math. Syst. Theory 27(2): 159-181 (1994) - [j96]Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
Properties of Grammatical Codes of Trees. Theor. Comput. Sci. 125(2): 259-293 (1994) - [j95]André H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Hyperedge Channels are Abelian. Theor. Comput. Sci. 127(2): 387-393 (1994) - [j94]André H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Clans and Regions in 2-Structures. Theor. Comput. Sci. 129(2): 207-262 (1994) - [j93]Andrzej Ehrenfeucht, Ross M. McConnell:
A k-Structure Generalization of the Theory of 2-Structures. Theor. Comput. Sci. 132(2): 209-227 (1994) - [c26]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Dynamic Labeled 2-Structures with Variable Domains. Results and Trends in Theoretical Computer Science 1994: 97-123 - [c25]Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Group Based Graph Transformations and Hierarchical Representations of Graphs. TAGT 1994: 502-520 - [p2]Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg:
Normal Forms for Contextual Grammars. Mathematical Aspects of Natural and Formal Languages 1994: 79-95 - 1993
- [j92]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On the Structure of Recognizable Languages of Dependence Graphs. RAIRO Theor. Informatics Appl. 27(1): 7-22 (1993) - [j91]Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
Combinatorial Properties of Texts. RAIRO Theor. Informatics Appl. 27(5): 433-464 (1993) - [j90]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
T-structures, T-functions, and texts. Theor. Comput. Sci. 116(2): 227-290 (1993) - [j89]Alberto Apostolico, Andrzej Ehrenfeucht:
Efficient Detection of Quasiperiodicities in Strings. Theor. Comput. Sci. 119(2): 247-265 (1993) - [c24]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Paulien ten Pas, Grzegorz Rozenberg:
An Introduction to Context-free Text Grammars. Developments in Language Theory 1993: 357-369 - [c23]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
An Introduction to Dynamic Labled 2-Structures. MFCS 1993: 156-173 - 1992
- [j88]Andrzej Ehrenfeucht, Marek W. Zawadowski:
A representation of partial Boolean algebras. Fundam. Informaticae 16(3-4): 349-353 (1992) - [j87]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Angular 2-Structures. Theor. Comput. Sci. 92(2): 227-248 (1992) - 1991
- [j86]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Grammatical codes of trees. Discret. Appl. Math. 32(2): 103-129 (1991) - 1990
- [j85]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem. Acta Informatica 27(4): 315-342 (1990) - [j84]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems. Acta Informatica 27(4): 343-368 (1990) - [j83]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions. Acta Informatica 28(1): 83-94 (1990) - [j82]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. Theor. Comput. Sci. 70(3): 277-303 (1990) - [j81]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Theory of 2-Structures, Part II: Representation Through Labeled Tree Families. Theor. Comput. Sci. 70(3): 305-342 (1990) - [j80]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Primitivity is Hereditary for 2-Structures. Theor. Comput. Sci. 70(3): 343-358 (1990)
1980 – 1989
- 1989
- [j79]Anselm Blumer, Andrzej Ehrenfeucht, David Haussler:
Average sizes of suffix trees and DAWGs. Discret. Appl. Math. 24(1-3): 37-45 (1989) - [j78]Andrzej Ehrenfeucht, David Haussler:
Learning Decision Trees from Random Examples. Inf. Comput. 82(3): 231-246 (1989) - [j77]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) - [j76]Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4): 929-965 (1989) - [p1]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Clans and the Complexity of Dependence graphs. A Perspective in Theoretical Computer Science 1989: 33-37 - 1988
- [j75]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata. Acta Informatica 25(2): 203-231 (1988) - [j74]Andrzej Ehrenfeucht, David Haussler:
A new distance metric on strings computable in linear time. Discret. Appl. Math. 20(3): 191-203 (1988) - [c22]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 - [c21]Andrzej Ehrenfeucht, David Haussler:
Learning Decision Trees from Random Examples. COLT 1988: 182-194 - [c20]Patricia Baggett, Andrzej Ehrenfeucht:
Textual and visual access to a computer by people who know nothing about it. SIGDOC 1988: 121-134 - 1987
- [j73]Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
Occam's Razor. Inf. Process. Lett. 24(6): 377-380 (1987) - [j72]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
- [j71]IJsbrand Jan Aalbersberg, Grzegorz Rozenberg, Andrzej Ehrenfeucht:
On the membership problem for regular DNLC grammars. Discret. Appl. Math. 13(1): 79-85 (1986) - [j70]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Each Regular Code Is Included in A Maximal Regular Code. RAIRO Theor. Informatics Appl. 20(1): 89-96 (1986) - [j69]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. RAIRO Theor. Informatics Appl. 20(4): 405-424 (1986) - [j68]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. RAIRO Theor. Informatics Appl. 20(4): 425-439 (1986) - [j67]Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski:
Addendum to the paper "On the dependence of functions on their variables". J. Comb. Theory A 42(2): 317 (1986) - [j66]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) - [c19]Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract). STOC 1986: 273-282 - 1985
- [j65]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen:
A morphic representation of EOL languages and other ETOL languages. Discret. Appl. Math. 12(2): 115-122 (1985) - [j64]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Strong Iterative Pairs and The Regularity of Context-Free Languages. RAIRO Theor. Informatics Appl. 19(1): 43-56 (1985) - [j63]Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
A Combinatorial Property of EOL Languages. Math. Syst. Theory 18(3): 207-235 (1985) - [j62]Andrzej Ehrenfeucht, H. C. M. Kleijn, Grzegorz Rozenberg:
Adding Global Forbidding Context to Context-Free Grammars. Theor. Comput. Sci. 37: 337-360 (1985) - [j61]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) - [j60]Walter Bucher, Andrzej Ehrenfeucht, David Haussler:
On Total Regulators Generated by Derivation Relations. Theor. Comput. Sci. 40: 131-148 (1985) - [c18]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On coordinated rewriting. FCT 1985: 100-111 - [c17]Walter Bucher, Andrzej Ehrenfeucht, David Haussler:
On Total Regulators Generated by Derivation Relations. ICALP 1985: 71-79 - 1984
- [j59]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On regularity of languages generated by copying systems. Discret. Appl. Math. 8(3): 313-317 (1984) - [j58]Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead:
A new method of proving theorems on chromatic index. Discret. Math. 52(2-3): 159-164 (1984) - [j57]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
An Easy Proof of Greibach Normal Form. Inf. Control. 63(3): 190-199 (1984) - [j56]Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg:
On Ambiguity in Dos Systems. RAIRO Theor. Informatics Appl. 18(3): 279-295 (1984) - [j55]Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
On Inherently Ambiguous E0L Languages. Theor. Comput. Sci. 28: 197-214 (1984) - [j54]Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg:
Restrictions on NLC Graph Grammars. Theor. Comput. Sci. 31: 211-223 (1984) - [c16]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 - [c15]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 - 1983
- [j53]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. Bull. EATCS 21: 12-20 (1983) - [j52]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Repetition of Subwords in DOL Languages. Inf. Control. 59(1-3): 13-35 (1983) - [j51]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity of Locally Catenative D0L Languages. Inf. Process. Lett. 16(1): 7-9 (1983) - [j50]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity of m-Free D0L Languages. Inf. Process. Lett. 17(3): 121-124 (1983) - [j49]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Separating Power of Eol Systems. RAIRO Theor. Informatics Appl. 17(1): 13-22 (1983) - [j48]Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg:
Context Free Normal Systems and ETOL Systems. J. Comput. Syst. Sci. 26(1): 34-46 (1983) - [j47]Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg:
On Regularity of Context-Free Languages. Theor. Comput. Sci. 27: 311-332 (1983) - 1982
- [j46]Harold Abelson, Andrzej Ehrenfeucht, James Fickett, Jan Mycielski:
Compositional complexity of Boolean functions. Discret. Appl. Math. 4(1): 1-10 (1982) - [j45]Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Basic formulas and languages: PART II.Applications to E0L systems and forms. Discret. Appl. Math. 4(1): 11-22 (1982) - [j44]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Subword Complexities of Homomorphic Images of Languages. RAIRO Theor. Informatics Appl. 16(4): 303-316 (1982) - [j43]Andrzej Ehrenfeucht, Jeff Kahn, Roger D. Maddux, Jan Mycielski:
On the Dependence of Functions on Their Variables. J. Comb. Theory A 33(1): 106-108 (1982) - [j42]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Representation Theorems Using DOS Languages. Theor. Comput. Sci. 21: 75-90 (1982) - [j41]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) - [c14]Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg:
Conditions Enforcing Regularity of Context-Free Languages. ICALP 1982: 187-191 - [c13]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Repetitions in Homomorphisms and Languages. ICALP 1982: 192-211 - 1981
- [j40]Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Basic formulas and languages Part I. The theory. Discret. Appl. Math. 3(4): 235-255 (1981) - [j39]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity of D0L Languages with a Constant Distribution. Inf. Process. Lett. 13(3): 108-113 (1981) - [j38]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
FPOL Systems Generating Counting Languages. RAIRO Theor. Informatics Appl. 15(2): 161-173 (1981) - [j37]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen:
A Morphic Representation of Complements of Recursively Enumerable Sets. J. ACM 28(4): 706-714 (1981) - [j36]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir:
On ET0L Systems with Finite Tree-Rank. SIAM J. Comput. 10(1): 40-58 (1981) - [j35]Andrzej Ehrenfeucht, Rohit Parikh, Grzegorz Rozenberg:
Pumping Lemmas for Regular Sets. SIAM J. Comput. 10(3): 536-541 (1981) - [j34]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity of Square-Free D0L Languages. Theor. Comput. Sci. 16: 25-32 (1981) - [c12]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the (Generalized) Post Correspondence Problem with Lists of Length 2. ICALP 1981: 408-416 - [c11]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity and Square-Freeness of Formal Languages. Theoretical Computer Science 1981: 1-4 - 1980
- [j33]Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Many-to-one simulation in E0L forms is decidable. Discret. Appl. Math. 2(1): 73-76 (1980) - [j32]Andrzej Ehrenfeucht, Hermann A. Maurer, Grzegorz Rozenberg:
Continuous Grammars. Inf. Control. 46(1): 71-91 (1980) - [j31]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Basic Properties of DOS Systems and Languages. Inf. Control. 47(2): 137-153 (1980) - [j30]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Emptiness of the Intersection of Two D0S Languages Problem. Inf. Process. Lett. 10(4/5): 223-225 (1980) - [j29]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
The Sequence Equivalence Problem is Decidable for 0S Systems. J. ACM 27(4): 656-663 (1980) - [j28]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Every Two Equivalent D0L Systems have a Regular True Envelope. Theor. Comput. Sci. 10: 45-52 (1980) - [j27]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Ambiguity in E0L Systems. Theor. Comput. Sci. 12: 127-134 (1980) - [j26]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On a Bound for the D0L Sequence Equivalence Problem. Theor. Comput. Sci. 12: 339-342 (1980) - [c10]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
DOS Systems and Languages. ICALP 1980: 134-141
1970 – 1979
- 1979
- [j25]Andrzej Ehrenfeucht, D. M. Silberger:
Periodicity and unbordered segments of words. Discret. Math. 26(2): 101-109 (1979) - [j24]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
An Observation on Scattered Grammars. Inf. Process. Lett. 9(2): 84-85 (1979) - [j23]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Finding a Homomorphism Between Two Words is NP-Complete. Inf. Process. Lett. 9(2): 86-88 (1979) - [j22]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir:
On ET0L Systems with Rank. J. Comput. Syst. Sci. 19(3): 237-255 (1979) - [j21]Andrzej Ehrenfeucht, Jan Mycielski:
On k-Stable Functions. J. Comb. Theory A 27(3): 282-288 (1979) - 1978
- [j20]Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg:
A note on DOL length sets. Discret. Math. 22(3): 233-242 (1978) - [j19]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Simplifications of Homomorphisms. Inf. Control. 38(3): 298-309 (1978) - [j18]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Structure of Derivations in Deterministic ET0L Systems. J. Comput. Syst. Sci. 17(3): 331-347 (1978) - [j17]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
E0L Languages are not Codings of FP0L Languages. Theor. Comput. Sci. 6: 327-341 (1978) - [j16]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem. Theor. Comput. Sci. 7: 169-183 (1978) - 1977
- [j15]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Some Context Free Languages That Are Not Deterministic ETOL Languages. RAIRO Theor. Informatics Appl. 11(4): 273-291 (1977) - 1976
- [j14]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Proving that Certain Languages are not ETOL. Acta Informatica 6: 407-415 (1976) - [j13]Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg:
On the number of subwords of everywhere growing DTOL languages. Discret. Math. 15(3): 223-234 (1976) - [j12]Andrzej Ehrenfeucht, H. Paul Zeiger:
Complexity Measures for Regular Expressions. J. Comput. Syst. Sci. 12(2): 134-146 (1976) - [j11]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum:
A Relationship between ET0L and EDT0L Languages. Theor. Comput. Sci. 1(4): 325-330 (1976) - 1975
- [j10]Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg:
Subword complexities of various classes of deterministic developmental languages with interactions. Int. J. Parallel Program. 4(3): 219-236 (1975) - [j9]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Pumping Theorem for Deterministic Etol Languages. RAIRO Theor. Informatics Appl. 9(2): 13-12 (1975) - [j8]Andrzej Ehrenfeucht:
Practical Decidability. J. Comput. Syst. Sci. 11(3): 392-396 (1975) - [j7]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) - [c9]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Inverse Homomorphic Images of Deterministic ET0L Languages. Automata, Languages, Development 1975: 179-189 - [c8]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Θ-Determined E0L Languages. Automata, Languages, Development 1975: 191-202 - [c7]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On (Un)predictability of Formal Languages (Extended Abstract). STOC 1975: 117-120 - [c6]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the (Combinatorial) Structure of L Languages without Interactions. STOC 1975: 137-144 - 1974
- [j6]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. Acta Informatica 3: 265-283 (1974) - [j5]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages. Inf. Control. 26(3): 256-271 (1974) - [j4]Andrzej Ehrenfeucht, Jan Mycielski:
On Families of Intersecting Sets. J. Comb. Theory A 17(2): 259-260 (1974) - [c5]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Three Useful Results Concerning L Languages Without Interactions. L Systems 1974: 72-77 - [c4]Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg:
Generatively Deterministic L Languages. Subword Point of View. L Systems 1974: 93-103 - [c3]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
D0L Systems With Rank. L Systems 1974: 136-141 - [c2]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 - [c1]Andrzej Ehrenfeucht, H. Paul Zeiger:
Complexity Measures for Regular Expressions. STOC 1974: 75-79 - 1973
- [j3]Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Limit Theorem for Sets of Subwords in Deterministic T0L Languages. Inf. Process. Lett. 2(3): 70-73 (1973) - [j2]Andrzej Ehrenfeucht:
Discernible Elements in Models for Peano Arithmetic. J. Symb. Log. 38(2): 291-292 (1973)
1950 – 1959
- 1957
- [j1]Andrzej Ehrenfeucht:
Two Theories with Axioms Built by Means of Pleonasms. J. Symb. Log. 22(1): 36-38 (1957)
Coauthor Index
[j140] [c50] [j139] [j138] [c49] [c48] [j137] [j136] [c47] [c46] [c45] [j135] [j134] [c44] [c43] [j132] [j131] [j130] [c42] [j129] [c40] [c39] [j128] [j127] [j126] [c38] [j125] [j124] [j123] [j122] [c37] [j121] [c36] [c35] [j120] [j119] [j118] [j117] [j116] [j115] [c34] [c33] [c32] [j114] [b1] [c31] [j113] [j112] [c30] [j111] [j110] [p4] [p3] [j109] [j108] [j107] [j106] [c29] [j104] [c27] [j103] [j102] [j101] [j100] [j98] [j97] [j96] [j95] [j94] [c26] [c25] [p2] [j92] [j91] [j90] [c24] [c23] [j87] [j86] [j85] [j84] [j83] [j82] [j81] [j80] [p1] [j75] [j71] [j70] [j69] [j68] [j66] [j65] [j64] [j63] [j62] [c18] [j59] [j57] [j56] [j55] [j54] [j52] [j51] [j50] [j49] [j48] [j47] [j45] [j44] [j42] [j41] [c14] [c13] [j40] [j39] [j38] [j37] [j36] [j35] [j34] [c12] [c11] [j33] [j32] [j31] [j30] [j29] [j28] [j27] [j26] [c10] [j24] [j23] [j22] [j20] [j19] [j18] [j17] [j16] [j15] [j14] [j13] [j11] [j10] [j9] [j7] [c9] [c8] [c7] [c6] [j6] [j5] [c5] [c4] [c3] [c2] [j3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
