Pages that link to "Item:Q5053717"
From MaRDI portal
The following pages link to Words, Semigroups, and Transductions (Q5053717):
Displayed 33 items.
- SOME OPERATORS ON FAMILIES OF FUZZY LANGUAGES AND THEIR MONOIDS (Q5053718) (← links)
- MIXED LINKS: A METHOD FOR GENERATING MULTI-STRANDED STRUCTURES IN SYNTAX (Q5053719) (← links)
- LIARS, DEMONS, AND CHAOS (Q5053721) (← links)
- SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES (Q5053722) (← links)
- CONDITIONAL GRAMMARS WITH RESTRICTIONS BY SYNTACTIC PARAMETERS (Q5053723) (← links)
- ON COMPLETE CLASSES OF DIRECTED GRAPHS (Q5053724) (← links)
- CIRCULARITY AND OTHER INVARIANTS OF GENE ASSEMBLY IN CILIATES (Q5053725) (← links)
- A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS (Q5053726) (← links)
- CATENATION CLOSED PAIRS AND FOREST LANGUAGES (Q5053727) (← links)
- VALENCE GRAMMARS WITH TARGET SETS (Q5053728) (← links)
- ON ISOMORPHIC REPRESENTATIONS OF MONOTONE TREE AND NONDETERMINISTIC TREE AUTOMATA (Q5053729) (← links)
- MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES (Q5053730) (← links)
- VISUALIZING LANGUAGES USING PRIMITIVE POWERS (Q5053731) (← links)
- ON SPARSE 0L LANGUAGES OVER THE BINARY ALPHABET (Q5053732) (← links)
- ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES (Q5053733) (← links)
- PREHOMOMORPHISMS ON LOCALLY INVERSE *-SEMIGROUPS (Q5053734) (← links)
- TESTING USING X-MACHINE TRANSLATIONS (Q5053735) (← links)
- SOME FUNDAMENTAL THEOREMS ON BCK (Q5053736) (← links)
- A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF <font>P</font> SYSTEMS (Q5053737) (← links)
- DISJUNCTIVITY (Q5053738) (← links)
- STRING OPERATIONS SUGGESTED BY DNA BIOCHEMISTRY: THE BALANCED CUT OPERATION (Q5053739) (← links)
- HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS (Q5053740) (← links)
- GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS (Q5053741) (← links)
- ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION (Q5053742) (← links)
- TIME-VARYING DISTRIBUTED <font>H</font> SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES (Q5053743) (← links)
- ON THE POWER OF RRWW-AUTOMATA (Q5053744) (← links)
- A DEFINITION OF PARIKH CONTROLLED CONTEXT-FREE GRAMMARS AND SOME PROPERTIES OF THEM (Q5053745) (← links)
- WORDS, DYCK PATHS, TREES, AND BIJECTIONS (Q5053746) (← links)
- SEMILATTICE AMALGAMS AND SEMIDIRECT PRODUCT (Q5053747) (← links)
- CHARACTERIZATION OF FINITE AUTOMATA BY THE IMAGES AND THE KERNELS OF THEIR TRANSITION FUNCTIONS (Q5053748) (← links)
- ITERATED MORPHISMS WITH COMPLEMENTARITY ON THE DNA ALPHABET (Q5053749) (← links)
- TOPOLOGIES FOR THE SET OF DISJUNCTIVE ω-WORDS (Q5053750) (← links)
- BACK MATTER (Q5053751) (← links)