The following pages link to Seymour Ginsburg (Q578942):
Displaying 50 items.
- Object histories which avoid certain subsequences (Q578943) (← links)
- Decision problems of object histories (Q582039) (← links)
- A prime decomposition theorem for grammatical families (Q584932) (← links)
- Interval queries on object histories (Q673106) (← links)
- On mappings from the family of well ordered subsets of a set (Q767493) (← links)
- Sets which are not homeomorphic by m-decomposition (Q768041) (← links)
- On the equality of grammatical families (Q791327) (← links)
- Input-dependent-only object histories (Q909491) (← links)
- On the decomposition of datalog program mappings (Q915437) (← links)
- On completing tables to satisfy functional dependencies (Q1066682) (← links)
- Order dependency in the relational model (Q1069711) (← links)
- Characterizations for functional dependency and Boyce-Codd normal form families (Q1069712) (← links)
- Projection of object histories (Q1099659) (← links)
- Canonical forms for interval functions (Q1102098) (← links)
- Cohesion of object histories (Q1114448) (← links)
- Position-restricted grammar forms and grammars (Q1160492) (← links)
- Tree acceptors and grammar forms (Q1160494) (← links)
- Localizable constraints for object histories (Q1183583) (← links)
- On incomparable abstract family of languages (AFL) (Q1210909) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Context-free grammar forms (Q1226865) (← links)
- Some uniformly erasable families of languages (Q1232299) (← links)
- On quasi-interpretations of grammar forms (Q1240571) (← links)
- The structure of context-free grammatical families (Q1241983) (← links)
- Pushdown acceptor forms (Q1243144) (← links)
- Substitution of grammar forms (Q1244820) (← links)
- On strongly equivalent context-free grammar forms (Q1245574) (← links)
- Precedence relations in grammar forms (Q1251075) (← links)
- Regular sequence operations and their use in database queries (Q1267707) (← links)
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
- Content-related interval queries on object histories (Q1803655) (← links)
- Sequences in context free languages (Q2395865) (← links)
- Semigroups, Presburger formulas, and languages (Q2523032) (← links)
- Bracketed context-free languages (Q2525996) (← links)
- Derivation-bounded languages (Q2533505) (← links)
- Principal AFL (Q2540269) (← links)
- On the existence of generators for certain AFL (Q2541640) (← links)
- Substitution in families of languages (Q2544191) (← links)
- AFL with the semilinear property (Q2552027) (← links)
- On AFL generators for finitely encoded AFA (Q2556749) (← links)
- A class of everywhere branching sets (Q2651133) (← links)
- On decompositions of chain datalog programs into P (left-)linear 1-rule components (Q3125088) (← links)
- (Q3217646) (← links)
- Decompositions of a set into disjoint pairs (Q3227657) (← links)
- Uniqueness in the Left Division of Order Types (Q3227661) (← links)
- On the Existence of Complete Boolean Algebras Whose Principal Ideals are Isomorphic to Each Other (Q3249010) (← links)
- Some Operators on Uniform Spaces (Q3260153) (← links)
- On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine (Q3261701) (← links)
- On the Reduction of Superfluous States in a Sequential Machine (Q3261702) (← links)
- Some Remarks on Abstract Machines (Q3275833) (← links)
