Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Andrzej Ehrenfeucht - MaRDI portal

Andrzej Ehrenfeucht

From MaRDI portal
(Redirected from Person:1004075)
Person:294724

Available identifiers

zbMath Open ehrenfeucht.andrzejWikidataQ93055 ScholiaQ93055MaRDI QIDQ294724

List of research outcomes

PublicationDate of PublicationType
CIRCULARITY AND OTHER INVARIANTS OF GENE ASSEMBLY IN CILIATES2022-12-06Paper
A model for the origin of internal eliminated segments (IESs) and gene rearrangement in stichotrichous ciliates2020-10-28Paper
Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates2020-05-06Paper
Complete inverted files for efficient text retrieval and analysis2020-04-05Paper
Theory of 2-structures2019-01-10Paper
Group based graph transformations and hierarchical representations of graphs2019-01-10Paper
Reaction Systems: A Model of Computation Inspired by the Functioning of the Living Cell2018-09-20Paper
https://portal.mardi4nfdi.de/entity/Q46438572018-05-29Paper
Evolving reaction systems2017-06-15Paper
Pancyclicity in switching classes2016-06-16Paper
Standard and ordered zoom structures2015-12-10Paper
ZOOM STRUCTURES AND REACTION SYSTEMS YIELD EXPLORATION SYSTEMS2014-11-14Paper
A Pseudorandom Sequence--How Random Is It?2014-01-22Paper
Minimal Reaction Systems2013-04-03Paper
Reaction Systems: A Natural Computing Approach to the Functioning of Living Cells2013-02-26Paper
STABILITY AND CHAOS IN REACTION SYSTEMS2013-01-18Paper
Relevance of Entities in Reaction Systems2012-11-01Paper
A Formal Framework for Processes Inspired by the Functioning of Living Cells2012-09-20Paper
A TOUR OF REACTION SYSTEMS2012-08-29Paper
Representing Reaction Systems by Trees2012-06-15Paper
Reaction Systems with Duration2011-06-24Paper
Position heaps: a simple and dynamic text indexing data structure2011-05-03Paper
FUNCTIONS DEFINED BY REACTION SYSTEMS2011-02-23Paper
Reaction Systems: A Model of Computation Inspired by Biochemistry2010-08-31Paper
COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS2010-06-18Paper
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure2009-07-07Paper
Introducing time in reaction systems2009-03-02Paper
Biochemical Reactions as Computations2007-11-13Paper
Graph Transformations2007-06-21Paper
Events and modules in reaction systems2007-05-11Paper
https://portal.mardi4nfdi.de/entity/Q34255692007-02-26Paper
https://portal.mardi4nfdi.de/entity/Q34255812007-02-26Paper
https://portal.mardi4nfdi.de/entity/Q34160752007-01-19Paper
Finite metrics in switching classes2007-01-09Paper
Embedding linear orders in grids2006-05-26Paper
COVERS FROM TEMPLATES2006-05-10Paper
Developments in Language Theory2005-12-22Paper
Computation in living cells. Gene assembly in ciliates2005-04-26Paper
Zebra factorizations in free semigroups.2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47376672004-08-11Paper
Transitivity of local complementation and switching on graphs.2004-03-14Paper
Forbidding--enforcing systems2003-05-14Paper
Formal systems for gene assembly in ciliates.2003-01-22Paper
https://portal.mardi4nfdi.de/entity/Q47821202002-11-27Paper
Characterizing the micronuclear gene patterns in ciliates2002-09-25Paper
String and graph reduction systems for gene assembly in ciliates2002-09-11Paper
Sequences of languages in forbidding-enforcing families2002-07-25Paper
Gene assembly through cyclic graph decomposition2002-07-18Paper
https://portal.mardi4nfdi.de/entity/Q47623322001-06-21Paper
Permutations, parenthesis words, and Schröder numbers2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q45028052000-09-12Paper
https://portal.mardi4nfdi.de/entity/Q44926802000-07-17Paper
https://portal.mardi4nfdi.de/entity/Q49532032000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q42603631999-09-19Paper
On representing recursively enumerable languages by internal contextual languages1999-01-12Paper
Invariants of inversive 2-structures on groups of labels1998-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43708351998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43410281997-06-16Paper
A note on binary grammatical codes of trees1997-02-27Paper
The linear landscape of external contextual languages1996-10-27Paper
Finite languages for the representation of finite graphs1996-07-16Paper
The size of \(k\)-pseudotrees1995-07-24Paper
https://portal.mardi4nfdi.de/entity/Q48359011995-06-08Paper
Dynamic labeled 2-structures1995-04-06Paper
Hyperedge channels are abelian1995-02-09Paper
Combinatorial properties of dependence graphs1995-01-11Paper
https://portal.mardi4nfdi.de/entity/Q42963001994-10-09Paper
A \(k\)-structure generalization of the theory of 2-structures1994-09-25Paper
Incremental construction of 2-structures1994-09-15Paper
Clans and regions in 2-structures1994-07-31Paper
Context-free text grammars1994-06-02Paper
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs1994-04-21Paper
Combinatorial properties of texts1994-04-19Paper
Properties of grammatical codes of trees1994-04-05Paper
Semantics of trees1994-03-24Paper
Efficient detection of quasiperiodicities in strings1993-11-28Paper
T-structures, T-functions, and texts1993-10-17Paper
Permutable transformation semigroups1993-08-17Paper
On the structure of recognizable languages of dependence graphs1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40180731993-01-16Paper
Angular 2-structures1992-06-28Paper
Grammatical codes of trees1992-06-26Paper
A characterization of set representable labeled partial 2-structures through decompositions1992-06-25Paper
Partial (set) 2-structures. I: Basic notions and the representation problems1990-01-01Paper
Partial (set) 2-structures. II: State spaces of concurrent systems1990-01-01Paper
Theory of 2-structures. I: Clans, basic subclasses, and morphisms1990-01-01Paper
Theory of 2-structures. II: Representation through labeled tree families1990-01-01Paper
Primitivity is hereditary for 2-structures1990-01-01Paper
Average sizes of suffix trees and DAWGs1989-01-01Paper
Learning decision trees from random examples1989-01-01Paper
A general lower bound on the number of examples needed for learning1989-01-01Paper
Learnability and the Vapnik-Chervonenkis dimension1989-01-01Paper
Recording the use of memory in right-boundary grammars and push-down automata1988-01-01Paper
A new distance metric on strings computable in linear time1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37935501988-01-01Paper
Occam's razor1987-01-01Paper
Quasi-Monotonic Sequences: Theory, Algorithms and Applications1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835171987-01-01Paper
Addendum to the paper On the dependence of functions on their variables1986-01-01Paper
On the membership problem for regular DNLC grammars1986-01-01Paper
On the active and full use of memory in right-boundary grammars and push- down automata1986-01-01Paper
Each regular code is included in a maximal regular code1986-01-01Paper
Coordinated pair systems ; part I : Dyck works and classical pumping1986-01-01Paper
Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37836061986-01-01Paper
A morphic representation of EOL languages and other ETOL languages1985-01-01Paper
Adding global forbidding context to context-free grammars1985-01-01Paper
On total regulators generated by derivation relations1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36877371985-01-01Paper
A combinatorial property of EOL languages1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37369181985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37385871985-01-01Paper
On DOS languages and DOS mappings1984-01-01Paper
On inherently ambiguous E0L languages1984-01-01Paper
On regularity of languages generated by copying systems1984-01-01Paper
A new method of proving theorems on chromatic index1984-01-01Paper
Restrictions on NLC graph grammars1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32176311984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36803001984-01-01Paper
An easy proof of Greibach normal form1984-01-01Paper
On the subword complexity of m-free DOL languages1983-01-01Paper
On regularity of context-free languages1983-01-01Paper
On the size of the alphabet and the subword complexity of square-free DOL languages1983-01-01Paper
On binary equality sets and a solution to the test set conjecture in the binary case1983-01-01Paper
On the subword complexity of locally catenative DOL languages1983-01-01Paper
Context free normal systems and ETOL systems1983-01-01Paper
Repetition of subwords in DOL languages1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574541983-01-01Paper
Compositional complexity of Boolean functions1982-01-01Paper
Basic formulas and languages. II: Applications to EOL systems and forms1982-01-01Paper
The (generalized) Post correspondence problem with lists consisting of two words is decidable1982-01-01Paper
On the dependence of functions on their variables1982-01-01Paper
Representation theorems using DOS languages1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594501982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594511982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39684701982-01-01Paper
On the subword complexity of DOL languages with a constant distribution1981-01-01Paper
On the subword complexity of square-free DOL languages1981-01-01Paper
Basic formulas and languages. I: The theory1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33393131981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39236241981-01-01Paper
On Etol Systems with Finite Tree-Rank1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408671981-01-01Paper
A Morphic Representation of Complements of Recursively Enumerable Sets1981-01-01Paper
Universal terms of the form \(B^nA^m\)1980-01-01Paper
Many-to-one simulation in EOL forms is decidable1980-01-01Paper
On ambiguity in EOL systems1980-01-01Paper
On a bound for the DOL sequence equivalence problem1980-01-01Paper
On the emptiness of the intersection of two DOS languages problem1980-01-01Paper
Every two equivalent DOL systems have a regular true envelope1980-01-01Paper
Some problems on the universality of words in groups1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206671980-01-01Paper
On basic properties of DOS systems and languages1980-01-01Paper
The Sequence Equivalence Problem is Decidable for 0S Systems1980-01-01Paper
Continuous grammars1980-01-01Paper
Finding a homomorphism between two words is NP-complete1979-01-01Paper
Periodicity and unbordered segments of words1979-01-01Paper
Avoidable patterns in strings of symbols1979-01-01Paper
On ETOL systems with rank1979-01-01Paper
On k-stable functions1979-01-01Paper
Positional strategies for mean payoff games1979-01-01Paper
An observation on scattered grammars1979-01-01Paper
Homomorphisms of direct powers of algebras1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38521971979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38546471979-01-01Paper
An infinite solitaire game with a random strategy1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38770591979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38995291979-01-01Paper
A note on DOL length sets1978-01-01Paper
EOL languages are not codings of FPOL languages1978-01-01Paper
On the structure of derivations in deterministic ETOL systems1978-01-01Paper
Elementary homomorphisms and a solution of the DOL sequence equivalence problem1978-01-01Paper
Simplifications of homomorphisms1978-01-01Paper
Decomposing a transformation with an involution1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30498331977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41579571977-01-01Paper
Complexity measures for regular expressions1976-01-01Paper
On proving that certain languages are not ETOL1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41166251976-01-01Paper
Practical decidability1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41350251975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41396981975-01-01Paper
Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems1974-01-01Paper
On families on intersecting sets1974-01-01Paper
On axial maps of direct product,s I1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40456711974-01-01Paper
The number of occurrences of letters versus their distribution in some EOL languages1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40626631974-01-01Paper
The equality of EOL languages and codings of ol languages1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40964531974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138291974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331241974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47737101974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47772781974-01-01Paper
A limit theorem for set of subwords in deterministic TOL laguages1973-01-01Paper
Polynomial functions with exponentiation are well ordered1973-01-01Paper
Interpolation of functions over a measure space and conjectures about memory1973-01-01Paper
Size direction games over the real line. I1973-01-01Paper
Organization of Memory1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40491161973-01-01Paper
Discernible elements in models for Peano arithmetic1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56708001972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445581972-01-01Paper
Abbreviating proofs by adding new axioms1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56370741971-01-01Paper
On Models with Undefinable Elements.1971-01-01Paper
A finitely axiomatizable complete theory with atomlessF 1(T)1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55342241967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56014541967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55096761966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55467821965-01-01Paper
A characterization of abelian groups1962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55511571961-01-01Paper
Representability op recursively enumerable sets in formal theories1961-01-01Paper
An application of games to the completeness problem for formalized theories1961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32915251961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53438891960-01-01Paper
Two theories with axioms built by means of pleonasms1957-01-01Paper
On theories categorical in power1957-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32898611957-01-01Paper
Models of axiomatic theories admitting automorphisms1956-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32393111956-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58489111955-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58269561954-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58313631954-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andrzej Ehrenfeucht