Andrzej Ehrenfeucht

Andrzej Ehrenfeucht's AcademicInfluence.com Rankings

Andrzej Ehrenfeucht

Computer Science

#549

World Rank

#569

Historical Rank

Theoretical Computer Science

#17

World Rank

#17

Historical Rank

computer-science Degrees

Andrzej Ehrenfeucht

Mathematics

#1270

World Rank

#2123

Historical Rank

Measure Theory

#588

World Rank

#818

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Andrzej Ehrenfeucht's Degrees

PhD Mathematics University of Warsaw

Why Is Andrzej Ehrenfeucht Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Andrzej Ehrenfeucht is a Polish-American mathematician and computer scientist. Life Andrzej Ehrenfeucht formulated the Ehrenfeucht–Fraïssé game, using the back-and-forth method given in Roland Fraïssé's PhD thesis. Also named for Ehrenfeucht is the Ehrenfeucht–Mycielski sequence.

(See a Problem?)

Andrzej Ehrenfeucht's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Learnability and the Vapnik-Chervonenkis dimension (1989) (1995)
Information content of binding sites on nucleotide sequences. (1986) (949)
Use of the 'Perceptron' algorithm to distinguish translational initiation sites in E. coli. (1982) (654)
Occam's Razor (1987) (599)
An application of games to the completeness problem for formalized theories (1961) (592)
A general lower bound on the number of examples needed for learning (1988) (515)
Positional strategies for mean payoff games (1979) (385)
The Smallest Automaton Recognizing the Subwords of a Text (1985) (354)
Avoidable patterns in strings of symbols (1979) (300)
Organization of memory. (1973) (256)
Complete inverted files for efficient text retrieval and analysis (1987) (254)
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension (1986) (201)
Reaction Systems (2007) (174)
Learning decision trees from random examples (1988) (172)
Partial (set) 2-structures (1990) (171)
Complexity measures for regular expressions (1974) (127)
Models of axiomatic theories admitting automorphisms (1956) (127)
The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs (1997) (121)
Primitivity is Hereditary for 2-Structures (1990) (119)
Partial (set) 2-structures (1990) (112)
Efficient Detection of Quasiperiodicities in Strings (1993) (109)
On Regularity of Context-Free Languages (1983) (109)
Molecular operations for DNA processing in hypotrichous ciliates (2001) (105)
Theory of 2-Structures (1995) (101)
Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions (1975) (99)
Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms (1990) (95)
A Tour of reaction Systems (2011) (93)
Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates. (2003) (92)
Computational Aspects of Gene (Un)Scrambling in Ciliates (2002) (90)
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable (1982) (86)
Theory of 2-Structures, Part II: Representation Through Labeled Tree Families (1990) (83)
A new distance metric on strings computable in linear time (1988) (82)
Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem (1978) (81)
Computation in Living Cells (2004) (78)
Encoding and retaining information in the visuals and verbals of an educational movie (1983) (77)
Events and modules in reaction systems (2007) (75)
Introducing time in reaction systems (2009) (67)
Average sizes of suffix trees and DAWGs (1989) (64)
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series) (2003) (63)
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs (1994) (60)
Formal systems for gene assembly in ciliates (2003) (58)
Periodicity and unbordered segments of words (1979) (56)
String and graph reduction systems for gene assembly in ciliates (2002) (54)
Linear size finite automata for the set of all subwords of a word - an outline of results (1983) (54)
Universal and simple operations for gene assembly in ciliates (2001) (54)
Contextual Grammars and Formal Languages (1997) (52)
Combinatorics of Life and Death for Reaction Systems (2010) (51)
Functions Defined by Reaction Systems (2011) (50)
Abbreviating proofs by adding new axioms (1971) (45)
Reaction Systems with Duration (2011) (42)
The Computational Complexity of ({\it XOR, AND\/})-Counting Problems (1990) (42)
Finding a Homomorphism Between Two Words is NP-Complete (1979) (40)
A Pseudorandom Sequence-How Random Is It? (1992) (39)
Pumping Lemmas for Regular Sets (1981) (39)
Simplifications of Homomorphisms (1978) (38)
Each Regular Code Is Included in A Maximal Regular Code (1986) (38)
On theories categorical in power (1957) (37)
On the Subword Complexity of Square-Free D0L Languages (1981) (37)
Characterizing the Micronuclear Gene Patterns in Ciliates (2002) (36)
Position heaps: A simple and dynamic text indexing data structure (2011) (36)
Some problem in elementary arithmetics (1976) (35)
On Some Context Free Languages That Are Not Deterministic ETOL Languages (1977) (35)
Conceptualizing in Assembly Tasks (1988) (35)
Basic Notions of Reaction Systems (2004) (34)
Circularity and Other Invariants of Gene Assembly in Ciliates (2001) (34)
On the membership problem for regular DNLC grammars (1986) (33)
Polynomial functions with exponentiation are well ordered (1973) (32)
On binary equality sets and a solution to the test set conjecture in the binary case (1983) (29)
Minimal Reaction Systems (2012) (29)
Dynamic labeled 2-structures (1994) (29)
Restrictions on NLC Graph Grammars (1984) (28)
A Relationship between ET0L and EDT0L Languages (1976) (27)
A Note on Causalities in Reaction Systems (2010) (26)
Reaction Systems: A Model of Computation Inspired by the Functioning of the Living Cell (2017) (26)
Zoom Structures and reaction Systems Yield Exploration Systems (2014) (25)
On regularity of languages generated by copying systems (1984) (25)
On Representing Recursively Enumerable Languages by Internal Contextual Languages (1998) (25)
On the Subword Complexity of D0L Languages with a Constant Distribution (1981) (24)
Reaction Systems: A Natural Computing Approach to the Functioning of Living Cells (2012) (24)
On Subword Complexities of Homomorphic Images of Languages (1982) (24)
Building a complete inverted file for a set of text files in linear time (1984) (24)
On Total Regulators Generated by Derivation Relations (1985) (24)
A new method of proving theorems on chromatic index (1984) (23)
Forbidding-enforcing systems (2003) (22)
Practical Decidability (1975) (22)
Patterns of Micronuclear Genes in ciliates (2001) (22)
The equality of EOL languages and codings of ol languages (1974) (21)
Representability op recursively enumerable sets in formal theories (1960) (21)
Complexity Issues in Switching of Graphs (1998) (21)
Evolving reaction systems (2017) (20)
Information in Content Equivalent Movie and Text Stories. (1982) (20)
Subword complexities of various classes of deterministic developmental languages with interactions (1975) (20)
T-structures, T-functions, and texts (1993) (20)
Gene assembly through cyclic graph decomposition (2002) (20)
Discernible elements in models for Peano arithmetic (1973) (19)
Angular 2-Structures (1992) (19)
A Limit Theorem for Sets of Subwords in Deterministic T0L Languages (1973) (18)
Do infinite nilpotent groups always have equipotent Abelian subgroups (1972) (18)
On the Subword Complexity of m-Free D0L Languages (1983) (18)
On the Separating Power of Eol Systems (1983) (18)
Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (1984) (18)
Qualitative and Quantitative Aspects of a Model for Processes Inspired by the Functioning of the Living Cell (2012) (18)
An educational program for paper sculpture: a case study in the design of software to enhance children's spatial cognition (1999) (17)
Building physical and mental models in assembly tasks (1991) (17)
Some problems on the universality of words in groups (1980) (16)
On a Bound for the D0L Sequence Equivalence Problem (1980) (16)
An Algorithm for Finding the Elementary Circuits of a Directed Graph ; CU-CS-024-73 (1973) (16)
The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages (1974) (16)
A Relationship between ETOL and EDTOL Languages (1974) (16)
Square Systems (1994) (15)
A k-Structure Generalization of the Theory of 2-Structures (1994) (15)
Three Useful Results Concerning L Languages Without Interactions (1974) (15)
On the Subword Complexity of Locally Catenative D0L Languages (1983) (15)
Universal terms of the formBnAm (1980) (14)
Review: A. A. Markov, On the Continuity of Constructive Functions (1956) (14)
Forbidding and enforcing (1999) (13)
Interpolation of functions over a measure space and conjectures about memory (1973) (13)
Pancyclicity in switching classes (2000) (13)
Two theories with axioms built by means of pleonasms (1957) (13)
How an unfamiliar thing should be called (1982) (11)
An Easy Proof of Greibach Normal Form (1986) (11)
Sequences of languages in forbidding–enforcing families (2001) (10)
Conditions Enforcing Regularity of Context-Free Languages (1982) (10)
A model for the origin of internal eliminated segments (IESs) and gene rearrangement in stichotrichous ciliates. (2007) (9)
Normal Forms for Contextual Grammars (1994) (9)
A Pumping Theorem for Deterministic Etol Languages (1975) (9)
Context-free text grammars (1994) (9)
Repetitions in Homomorphisms and Languages (1982) (9)
On Representing RE Languages by One-Sided Internal Contextual Languages (1996) (9)
Strong Iterative Pairs and The Regularity of Context-Free Languages (1985) (8)
What Should Be the Role of Calculators and Computers in Mathematics Education (1992) (8)
Grammatical codes of trees (1991) (8)
Reaction Systems: A Model of Computation Inspired by Biochemistry (2010) (8)
An Observation on Scattered Grammars (1979) (8)
Combinatorial Properties of Texts (1993) (8)
On the number of subwords of everywhere growing DTOL languages (1976) (8)
On the Emptiness of the Intersection of Two D0S Languages Problem (1980) (8)
On Basic Properties of DOS Systems and Languages (1980) (8)
On the (Generalized) Post Correspondence Problem with Lists of Length 2 (1981) (8)
A Morphic Representation of Complements of Recursively Enumerable Sets (1981) (8)
Stability and Chaos in reaction Systems (2012) (8)
On proving that certain languages are not ETOL (1976) (8)
Adding Global Forbidding Context to Context-Free Grammars (1985) (8)
On the Dependence of Functions on Their Variables (1982) (7)
Compositional complexity of Boolean functions (1982) (7)
On the size of the alphabet and the subword complexity of square-free DOI languages (1983) (7)
On the Subword Complexity and Square-Freeness of Formal Languages (1981) (7)
D0L Systems With Rank (1974) (7)
Decomposing a transformation with an involution (1977) (7)
On the structure of dependence graphs (1987) (7)
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma (1986) (7)
Clans and Regions in 2-Structures (1994) (6)
On ET0L Systems with Finite Tree-Rank (1981) (6)
A Compact Space of Models of First Order Theories (1979) (6)
A finitely axiomatizable complete theory with atomlessF1(T) (1971) (6)
On Inverse Homomorphic Images of Deterministic ET0L Languages (1975) (6)
Every Two Equivalent D0L Systems have a Regular True Envelope (1980) (6)
Representing Reaction Systems by Trees (2012) (6)
Embedding in Switching Classes with Skew Gains (2004) (6)
Elementary Theories with Models without Automorphisms (1974) (6)
Finite Languages for the Representation of Finite Graphs (1996) (6)
Standard and ordered zoom structures (2015) (6)
Basic formulas and languages: PART II.Applications to E0L systems and forms (1982) (5)
Elementary Homomorphisms and a Solution of the DOL Sequence Equivalence Problem ; CU-CS-115-77 (1977) (5)
Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems (1974) (5)
Basic formulas and languages Part I. The theory (1981) (5)
Group Based Graph Transformations and Hierarchical Representations of Graphs (1994) (5)
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping (1986) (5)
Homomorphisms of direct powers of algebras (1979) (5)
On the (combinatorial) structure of L languages without interactions (Extended Abstract) (1975) (5)
Properties of Grammatical Codes of Trees (1994) (5)
Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (1974) (5)
On axial maps of direct product,s I (1974) (5)
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata (1986) (5)
On coordinated rewriting (1985) (5)
DOS Systems and Languages (1980) (5)
On the Structure of Polynomially Bounded DOL Systems ; CU-CS-023-73 (1973) (5)
A Framework for Forming, Modifying, and Using Multimedia Concepts in Memory. Part I. Mathematical Formulation. (1982) (4)
An Introduction to Dynamic Labled 2-Structures (1993) (4)
On Binary Equality Sets and a Solution to the Ehrenfeucht Conjecture in the Binary Case ; CU-CS-221-82 (1983) (4)
Breaking Away from the Math Book II: More Creative Projects for Grades K-8 (1998) (4)
Hyperedge Channels are Abelian (1994) (4)
The linear landscape of external contextual languages (1996) (4)
Incremental construction of 2-structures (1994) (4)
Dynamic Labeled 2-Structures with Variable Domains (1994) (4)
On Inherently Ambiguous E0L Languages (1984) (4)
Size direction games over the real line. I (1973) (4)
An Introduction to Context-free Text Grammars (1993) (4)
On the Structure of Derivations in Deterministic ET0L Systems (1978) (4)
Invariants of inversive 2-structures on groups of labels (1997) (4)
Many-to-one simulation in E0L forms is decidable (1980) (4)
A characterization of abelian groups (1962) (4)
Representation Theorems Using DOS Languages (1982) (4)
String Searching (2004) (4)
Generatively Deterministic L Languages. Subword Point of View (1974) (4)
Covers from Templates (2006) (4)
The Sequence Equivalence Problem is Decidable for 0S Systems (1980) (3)
A morphic representation of EOL languages and other ETOL languages (1985) (3)
Review: S. V. Ablonskij, On Functional Completeness in the Three-Valued Calculus (1955) (3)
Transitivity of local complementation and switching on graphs (2004) (3)
Modelling Gene Assembly in Ciliates (2004) (3)
An Overview of the Cell (2004) (3)
On Models with Undefinable Elements. (1971) (3)
Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions (2010) (3)
On ET0L Systems with Rank (1979) (2)
On k-Stable Functions (1979) (2)
On Families of Intersecting Sets (1974) (2)
A note on DOL length sets (1978) (2)
Relevance of Entities in Reaction Systems (2012) (2)
A Multimedia Knowledge Representation for an 'Intelligent' Computerized Tutor. (1985) (2)
Every Two Equivalent DOL Systems Have a Regular True Envelope ; CU-CS-116-77 (1977) (2)
Clans and the Complexity of Dependence graphs (1989) (2)
Combinatorial Properties of Dependence Graphs (1994) (2)
Coordinated Pair Systems; Part I: Dyck Words and Classical Pumping ; CU-CS-275-84 (1984) (2)
Context Free Normal Systems and ETOL Systems (1983) (2)
Computational Nature of Processes Induced by Biochemical Reactions (2009) (2)
A characterization of set representable labeled partial 2-structures through decompositions (1990) (2)
A Result on the Structure of ETOL Languages ; CU-CS-136-78 (1978) (2)
Grammatical Codes of Trees and Terminally Coded Grammars (1995) (2)
EOL Languages Are Not Codings of FPOL Languages ; CU-CS-098-76 (1976) (2)
On the Structure of Recognizable Languages of Dependence Graphs (1993) (2)
Semantics of Nonsequential Tree-Based Computation Schemes (1997) (2)
A Note on Binary Grammatical Codes of Trees (1996) (2)
E0L Languages are not Codings of FP0L Languages (1978) (2)
On dos languages and dos mappings (1984) (2)
On Ambiguity in E0L Systems (1980) (2)
Textual and visual access to a computer by people who know nothing about it (1988) (2)
A Pumping Theorem for EDTOL Languages ; CU-CS-047-74 (1974) (2)
Biochemical Reactions as Computations (2007) (2)
FPOL Systems Generating Counting Languages (1981) (2)
On Arithmetic Substitutions of EDTOL Languages ; CU-CS-096-76 (1976) (1)
Ésénine-Volpine A. S.. Le programme ultra-intuitionniste des fondements des mathématiques. Infinitistic methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 2–9 September 1959, Panstwowe Wydawnictwo Naukowe, Warsaw, and Pergamon Press, Oxford-London-New York-Paris, 1961, pp. (1968) (1)
How people find information in a computer environment (1985) (1)
Basic Formulas and Languages Part II. Applications to EOL Systems and Forms ; CU-CS-192-80 (1980) (1)
Partial (Set) 2-Structures, Part I: Representation Problems ; CU-CS-340-86 (1986) (1)
On the Full Records of the Use of Memory in Right-Boundary Grammars and Push-Down Machines ; CU-CS-299-86 (1985) (1)
On the Active Use of Memory in Right-Boundary Grammars and Push-Down Machines ; CU-CS-298-86 (1985) (1)
Recording the use of memory in right-boundary grammars and push-down automata (1988) (1)
Zebra Factorizations in Free Semigroups (2004) (1)
Some remarks on the bracket free notations (1967) (1)
Zdzislaw Pawlak (1926-2006) (2006) (1)
Commutative Linear Languages ; CU-CS-209-81 (1981) (1)
The Sequence Equivalence Problem Is Decidable for OS Systems ; CU-CS-137-78 (1978) (1)
Finite metrics in switching classes (2007) (1)
On Regularity of Context-Free Languages ; CU-CS-235-82 (1982) (1)
Switching of Graphs (1999) (1)
On the Subword Complexity of m-Free DOL Languages ; CU-CS-232-82 (1982) (1)
From Mathematical Logic, to Natural Language, Artificial Intelligence, and Human Thinking (A short essay in honour of Andrzej Mostowski) (2008) (1)
On Total Regulators Generated by Derivation Relations ; CU-CS-301-85 (1984) (1)
The Embedding Problem for Switching Classes of Graphs (2006) (1)
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (2009) (1)
Behaviour of Elementary Net Systems ; CU-CS-339-86 (1986) (1)
Continuous Grammars (1980) (1)
A combinatorial property of EOL languages (1985) (1)
Computational Nature of Biochemical Reactions (2006) (1)
Context Free Normal Systems and ETOL Systems ; CU-CS-194-80 (1980) (1)
Some ETOL Languages Which Are Not Deterministic ; CU-CS-018-73 (1973) (1)
Semantics of trees (1994) (1)
A characterization of the state spaces of elementary net systems (1989) (1)
Involving Students in Original Research with Primary Sources (2018) (1)
Conceptualizing in Assembly Tasks. Technical Report No. 139. (1985) (1)
A Formal Framework for Processes Inspired by the Functioning of Living Cells (2012) (1)
On Inherently Ambiguous EOL Languages ; CU-CS-257-83 (1983) (1)
A Formal Framework for Bioprocesses in Living Cells (2011) (1)
On Some Context Free Languages Which Are Not ETOL Languages ; CU-CS-048-74 (1974) (1)
Review: V. A. Uspenskij, Systems of Enumerable Sets and Their Enumerations (1957) (1)
On the Subword Complexity of Square-Free DOL Languages ; CU-CS-174-80 (1980) (1)
A Browsing System Based on Multimedia Cohesion ; CU-CS-803-96 (1996) (1)
Embedding linear orders in grids (2006) (1)
On the Subword Complexity of Locally Catenative DOL Languages ; CU-CS-231-82 (1982) (1)
The Algorithmic Unsolvability of the Problem of Checking Certain Properties of Groups.@@@Finitely Generated Groups and Algorithms. (1958) (1)
The linear landscape of external contextual languages (1996) (0)
A calculus course for secondary mathematics education majors without algebra and precalculus prerequisites (2009) (0)
Clans of Switching Classes (1999) (0)
On the Separating Power of EOL Systems ; CU-CS-186-80 (1980) (0)
The Need for a Revision of the Prehistory of Arithmetic and its Relevance to School Mathematics (2016) (0)
A Note on Regular Canonical Systems ; CU-CS-279-84 (1984) (0)
Review: Allen Newell, Herbert A. Simon, The Logic Theory Machine. A Complex Information Processing System (1957) (0)
Arithmetic in Schools, Past, Present, and Future ; CU-CS-777-95 (1995) (0)
Molecular Operations for Gene Assembly (2004) (0)
Developing a Multimedia Browsing System Based on Cohesion ; CU-CS-881-99 (1999) (0)
A Generalization of a Theorem of Graham Higman ; CU-CS-219-81 (1981) (0)
Review: S. V. Ablonskij, Functional Constructions in Many-Valued Logics (1958) (0)
On Finite Automata with a Unison Working Tape ; CU-CS-278-84 (1984) (0)
Unstable Labelled 2-Structures (1999) (0)
A Note on Matrices of Trees ; CU-CS-044-74 (1974) (0)
Forbidding, Enforcing (1996) (0)
Codings of OL Languages ; CU-CS-025-73 (1973) (0)
Review: S. I. Adan, On the Divisibility Problem in Semigroups (1958) (0)
Conditions Enforcing Regularity of Context-Free Languages ; CU-CS-223-82 (1983) (0)
Generalized Post Correspondence Problem of Length 2, Part I: Some Special Cases and the Basic Transformation ; CU-CS-188-80 (1980) (0)
What is the role of practice in cognition (1988) (0)
The size of k-pseudotrees (1995) (0)
On THETA-Determined EOL Languages ; CU-CS-067-75 (1975) (0)
String Pointer Reduction System (2004) (0)
Repetitions in Homomorphisms and Languages ; CU-CS-222-82 (1983) (0)
MDS Arrangements and MDS Descriptors (2004) (0)
Áblonskij S. V.. O supérpoziciáh funkcij algébry logiki (On superpositions of functions of the algebra of logic). Matématičéskij sbornik, n.s. vol. 30 (1952), pp. 329–348. (1955) (0)
A Combinatorial Analysis of k-Pseudo Trees ; CU-CS-509-91 (1991) (0)
MDS Descriptor Pointer Reduction System (2004) (0)
Automorphisms of Labelled 2-Structures (1999) (0)
On the Organization of Memory ; CU-CS-014-73 (1973) (0)
Graph Pointer Reduction System (2004) (0)
An Ambiguity in EOL Systems ; CU-CS-158-79 (1979) (0)
Patterns of Subsets of Rules (2004) (0)
Figure 2 Here Figure 3 Here 4 Discussion (2007) (0)
Review: V. K. Detlovs, Normal Algorithms and Recursive Functions (1956) (0)
On Unary 2-Fold Equations ; CU-CS-187-80 (1980) (0)
Quotients and Homomorphisms (1999) (0)
Simplifications of Homomorphisms ; CU-CS-114-77 (1977) (0)
An infinite solitaire game with a random strategy (1979) (0)
Recording the use of memory in right-boundary grammars and push-down automata (1988) (0)
Negative Numbers in School Mathematics (2011) (0)
Finding a Homomorphism Between Two Words in NP-Complete ; CU-CS-134-78 (1978) (0)
Subwords in Deterministic TOL Languages ; CU-CS-015-73 (1973) (0)
Computations in Coordinate Pair Systems ; CU-CS-260-83 (1984) (0)
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach (2013) (0)
A Structural Characterization of Square-Free Homomorphisms ; CU-CS-229-82 (1982) (0)
The Robustness of Quadratic Voting (2016) (0)
On DOS Languages and DOS Mappings ; CU-CS-213-82 (1982) (0)
Complexity Problems in Switching Classes of Graphs (2015) (0)
On a Bound for the DOL Sequence Equivalence Problem ; CU-CS-163-79 (1979) (0)
Primitive 2-Structures (1999) (0)
DOS Systems and Languages ; CU-CS-160-79 (1979) (0)
Repetitive Properties of DOL Languages ; CU-CS-233-82 (1982) (0)
Áblonskij S. V.. O funkcional′noj polnoté v tréhznačnom isčislénii (On functional completeness in the three-valued calculus). Doklady Akadémii Nauk SSSR, vol. 95 (1954), pp. 1153–1155. (1955) (0)
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden Lemma ; CU-CS-276-84 (1984) (0)
On Structure of Derivations in ETOL Systems ; CU-CS-046-74 (1974) (0)
A representation of partial Boolean algebras (1992) (0)
On Θ-Determined E0L Languages (1975) (0)
Labelled 2-Structures (1999) (0)
Détlovs V. K.. Normal'nyé algorifmy i rékursivnyé funkcii (Normal algorithms and recursive functions). Doklady Akadémii Nauk SSSR, vol. 90 (1953), pp. 723–725. (1956) (0)
A criterion for a finitely generated group to be finite (1971) (0)
On the Size of the Alphabet and the Subword Complexity of Square-Free DOL Languages ; CU-CS-207-81 (1981) (0)
Restrictions on NLC Graph Grammars ; CU-CS-258-83 (1983) (0)
Representation Theorem Using DOS Languages ; CU-CS-161-79 (1979) (0)
On (un)predictability of formal languages (Extended Abstract) (1975) (0)
On ETOL Systems with Rank ; CU-CS-117-77 (1977) (0)
An Observation on Scattered Grammars ; CU-CS-135-78 (1978) (0)
Complexity Measures for Regular Expressions ; CU-CS-066-75 (1975) (0)
On Ambiguity in Dos Systems (1984) (0)
1 String Searching (2005) (0)
A deceptive fact about functions (2000) (0)
On k-Stable Functions ; CU-CS-111-77 (1977) (0)
Graph Theoretical Preliminaries (1999) (0)
Real Time Coordinated Pair Systems ; CU-CS-259-83 (1983) (0)
Uspénskij V. A.. Sistémy péréčislimyh množéstv i ih numéracii (Systems of enumerable sets and their enumerations). Doklady Akadéimii Nauk SSSR, vol. 105 (1955), pp. 1155–1158. (1957) (0)
On the Consistency and Correctness of School Mathematics ; CU-CS-918-01 (2001) (0)
Greibach Normal Form Seen as a Transformation of Trees ; CU-CS-254-83 (1983) (0)
Review: S. V. Ablonskij, On Superpositions of Functions of the Algebra of Logic (1955) (0)
On Decomposing Some ETOL Languages Into Deterministic ETOL Languages ; CU-CS-045-74 (1974) (0)
Subtraction Strategies of Second and Fourth Grade Children on Problems Containing Whole Numbers, Decimals, and Negative Numbers ; CU-CS-775-95 (1995) (0)
On Ambiguity in DOS Systems ; CU-CS-215-82 (1982) (0)
Processes Based on Biochemical Interactions: Natural Computing Point of View ⋆ (2009) (0)
Each Regular Code Is Included in Maximal Regular Code ; CU-CS-236-82 (1982) (0)
A browsing system based on mul timedia cohesion (1996) (0)
Repetition of Words in DOL Languages ; CU-CS-224-82 (1982) (0)
Content and Teaching Methods in Elementary School Mathematics ; CU-CS-810-96 (1996) (0)
2-Structures and Their Clans (1999) (0)
Electronic Communications of the EASST Volume 30 ( 2010 ) International Colloquium on Graph and Model Transformation On the occasion of the 65 th birthday of Hartmut Ehrig ( GraMoT 2010 ) A Note on Causalities in Reaction Systems (2010) (0)
Two DOS Languages Problem ; CU-CS-159-79 (1979) (0)
Pumping Lemmas for Regular Sets ; CU-CS-155-79 (1979) (0)
Marcy's Dots: A Problem on National Test Revisited (2002) (0)
The Embedding Problem For Switching Classes (2005) (0)
Advanced Problems: 6393-6398 (1982) (0)
Partnership Mathematics Content Courses for Prospective and Practising Elementary and Middle School Teachers. (2013) (0)
Advanced Problems: 5916-5921 (1973) (0)
Advanced Problems: 6362-6367 (1981) (0)
Labelled Structures over Groups (1999) (0)
A Morphic Representation of Compliments of Recursively Enumerable Sets ; CU-CS-193-80 (1980) (0)
The Number of Occurrences of Letters Versus Their Distribution in EOL Languages ; CU-CS-030-73 (1973) (0)
Do Children Require Drill in Order to Acquire Skill in Using Calculators? ; CU-CS-749-94 (1994) (0)
Quotients and Plane Trees (1999) (0)
Generalized Post Correspondence Problem of Length 2, Part III: Decidability ; CU-CS-190-80 (1980) (0)
An East Proof of Greibach Normal Form ; CU-CS-255-83 (1983) (0)
Generalized Post Correspondence Problem of Length 2, Part II: Cases Distinguished by Patterns ; CU-CS-189-80 (1980) (0)
On the Subword Complexity of DOL Languages with a Constant Distribution ; CU-CS-206-81 (1981) (0)
Marcy's Dots: A Problem on a National Test Revisited ; CU-CS-916-01 (2001) (0)
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach - (Abstract) (2013) (0)
Modeling Interactions between Biochemical Reactions (2008) (0)
A Combinatorial Property of EOL Languages ; CU-CS-228-82 (1982) (0)
Advanced Problems: 5946-5951 (1974) (0)
On Finite Sets Testing Square Free Property for All Homomorphisms Between Two Given Alphabets ; CU-CS-230-82 (1982) (0)
The Role of Calculators in Developing Children's Problem Solving Skills ; CU-CS-751-94 (1994) (0)
FPOL Systems Generating Counting Languages ; CU-CS-156-79 (1977) (0)
A Note on Numerically Dispersed EOL Languages ; CU-CS-097-76 (1976) (0)

This paper list is powered by the following services:

Other Resources About Andrzej Ehrenfeucht

What Schools Are Affiliated With Andrzej Ehrenfeucht?

Andrzej Ehrenfeucht is affiliated with the following schools:

Andrzej Ehrenfeucht's Academic­Influence.com Rankings

Andrzej Ehrenfeucht's Degrees

Why Is Andrzej Ehrenfeucht Influential?

Andrzej Ehrenfeucht's Published Works

Published Works

Other Resources About Andrzej Ehrenfeucht

What Schools Are Affiliated With Andrzej Ehrenfeucht?

Andrzej Ehrenfeucht's AcademicInfluence.com Rankings