The following pages link to Andrzej Ehrenfeucht (Q294724):
Displaying 50 items.
- Pancyclicity in switching classes (Q294726) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- On the subword complexity of m-free DOL languages (Q594602) (← links)
- Finding a homomorphism between two words is NP-complete (Q599499) (← links)
- A note on binary grammatical codes of trees (Q672152) (← links)
- T-structures, T-functions, and texts (Q685376) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- Characterizing the micronuclear gene patterns in ciliates (Q699814) (← links)
- Periodicity and unbordered segments of words (Q754298) (← links)
- On regularity of context-free languages (Q759489) (← links)
- On DOS languages and DOS mappings (Q791326) (← links)
- On inherently ambiguous E0L languages (Q796996) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- A new method of proving theorems on chromatic index (Q801928) (← links)
- Finite metrics in switching classes (Q858301) (← links)
- Events and modules in reaction systems (Q880167) (← links)
- Standard and ordered zoom structures (Q896702) (← links)
- Partial (set) 2-structures. I: Basic notions and the representation problems (Q911307) (← links)
- Partial (set) 2-structures. II: State spaces of concurrent systems (Q911308) (← links)
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms (Q913822) (← links)
- Theory of 2-structures. II: Representation through labeled tree families (Q913823) (← links)
- Primitivity is hereditary for 2-structures (Q913824) (← links)
- (Q1004075) (redirect page) (← links)
- Introducing time in reaction systems (Q1004076) (← links)
- On the size of the alphabet and the subword complexity of square-free DOL languages (Q1050120) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← links)
- A morphic representation of EOL languages and other ETOL languages (Q1067416) (← links)
- Addendum to the paper ''On the dependence of functions on their variables'' (Q1073030) (← links)
- On the membership problem for regular DNLC grammars (Q1082088) (← links)
- Adding global forbidding context to context-free grammars (Q1082822) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Recording the use of memory in right-boundary grammars and push-down automata (Q1099636) (← links)
- On the active and full use of memory in right-boundary grammars and push- down automata (Q1099637) (← links)
- A new distance metric on strings computable in linear time (Q1102764) (← links)
- Occam's razor (Q1108056) (← links)
- Avoidable patterns in strings of symbols (Q1137038) (← links)
- On ETOL systems with rank (Q1138388) (← links)
- On k-stable functions (Q1139046) (← links)
- Universal terms of the form \(B^nA^m\) (Q1142864) (← links)
- Many-to-one simulation in EOL forms is decidable (Q1143808) (← links)
- On ambiguity in EOL systems (Q1148689) (← links)
- On a bound for the DOL sequence equivalence problem (Q1151051) (← links)
- On the emptiness of the intersection of two DOS languages problem (Q1155962) (← links)
- Every two equivalent DOL systems have a regular true envelope (Q1157969) (← links)
- Compositional complexity of Boolean functions (Q1162360) (← links)
- On the subword complexity of square-free DOL languages (Q1162365) (← links)
- Basic formulas and languages. I: The theory (Q1166275) (← links)
- Basic formulas and languages. II: Applications to EOL systems and forms (Q1166276) (← links)
