Patent US4490789A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4490789A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and means for reproducing non-alphabetic characters

Assignee: Individual
•
Filing: 1980-07-11
•
Granted: 1984-12-25
•
Expires: 2000-07-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Non-alphabetic characters are reproduced by feeding into a computer symbols defining the gross form of each character, then feeding in successive pairs of symbols, with one symbol in each pair defining an element of the character and another symbol defining the juxtaposition of each element relative to previous elements. The operation of the computer is fixed by a program to cause a plotter to draw the elements in accordance with their juxtaposition and thereby form the characters.

Inventors

  • 👤 Carl Leban
  • 👤 executor Audrey Leban

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 10:00
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/01; G06F3/018; B; B41; B41J; B41J3/00; B41J3/01; G06F3/02

Claims Analysis

Total Claims: 32
Claim 1
Independent Claim 112 words
The method of transcribing ideographic or other non-alphabetic characters, including the steps of: entering into a computer a string of symbols composed of one plurality of symbols each defining at least one of a finite plurality of elements in the or each character, and a second plurality of symbols each defining one of a finite plurality of juxtapositional relationships of one of the elements to each other for the or each character; in the computer, decoding the string of symbols to determine the identity of each element, and the position of one element relative to the previous element; and transforming the decoded symbols into an assembly sensible as a character or characters.
Claim 2
Independent Claim 112 words
The method of transcribing ideographic or other non-alphabetic characters, including the steps of: entering into a computer a string of symbols composed of one plurality of symbols each defining at least one of a finite plurality of elements in the or each character, and a second plurality of symbols each defining one of a finite plurality of juxtapositional relationships of one of the elements to each other for the or each character; in the computer, decoding the string of symbols to determine the identity of each element, and the position of one element relative to the previous element; and transforming the decoded symbols into an assembly sensible as a character or characters.
Claim 3
Dependent Claim 23 words
The method according to claim 1, wherein the transforming step includes plotting the elements on the basis of the decoded string of symbols.
Claim 4
Dependent Claim 40 words
The method according to claim 1, wherein the step of transforming the decoded symbols includes adjusting the position of each of the elements on the basis of at least the number of predetermined ones of the elements in each character.
Claim 5
Dependent Claim 88 words
The method according to claim 3, wherein the step of transforming further includes the step of plotting the elements on the basis of the decoded symbols and the step of adjusting the size to form a character and wherein one of the plurality of second symbols is entered before one of the first plurality of symbols to define a different plurality of elements differing from the elements defined by the one of the first plurality of symbols being entered before the one of the second plurality of symbols.
Claim 6
Dependent Claim 58 words
The method according to claim 3, wherein the entering step includes entering as part of the string, a gross form symbol defining the gross form of the character, the decoding step includes decoding the gross form symbol, and the transforming step includes grouping the elements of the character and their sizes on the basis of their gross form.
Claim 7
Dependent Claim 71 words
The method according to claim 3, wherein the entering step includes entering in the string a gross form symbol defining the sections into which the character is divided, wherein the decoding step includes decoding the gross form symbol so as to determine the sections into which the characters is divided, and wherein the transforming step includes determining the size of each of the elements only after decoding the gross form symbol.
Claim 8
Dependent Claim 20 words
The method according to claim 6, wherein the gross form symbol is entered before any other symbols in a character.
Claim 9
Dependent Claim 75 words
The method according to claim 7, wherein the step of entering a symbol defining a juxtaposition includes entering the symbol as a sequential pair and each symbol defining at least one element defining two elements, determining with the sequence of symbols within each pair which element is defined, decoding the symbols defining juxtaposition with symbols defining elements in a pair, and decoding the symbol defining elements on the basis of the sequence within each pair.
Claim 10
Dependent Claim 57 words
The method according to claim 7, wherein the transforming step includes counting predetermined ones of the elements that have been decoded in each section, while not counting predetermined others of the elements, and adjusting the sizes of the individual ones of the elements as they are printed, and on the basis of the number of elements counted.
Claim 11
Dependent Claim 60 words
The method according to claim 7, wherein the step of entering the symbols defining the juxtapositional relationships, includes defining the position of one element relative to the element defined by the previous symbol defining an element, and wherein the step of decoding to determine the juxtapositional relationships includes determining the position of one element relative to the previously decoded element.
Claim 12
Independent Claim 88 words
The method according to claims 10 12, wherein the step of entering the symbols defining juxtapositional relationships includes defining whether the position of one element relative to a previous element is horizontally adjacent, vertically adjacent, has a contained relationship, or has an overwriting relationship with a previous element or groups of elements; and wherein the step of decoding includes determining whether the position of one element is horizontally adjacent, vertically adjacent, has a contained relationship or has an overwriting relationship with a previous element or groups of elements.
Claim 13
Dependent Claim 51 words
The method according to claim 7, wherein the step of entering symbols defining the juxtapositional relationships includes defining whether one element is horizontally adjacent another element, is vertically adjacent another element, has a containment relationship relative to another element, or has an overwriting relationship within another element or group of elements.
Claim 14
Independent Claim 76 words
The method according to claims 10 12 or 11, wherein the step of entering symbols defining whether an element has a containment relationship includes defining whether the contained element is in the left part of the containing element or the right part, and wherein the step of decoding the string of symbols and defining a containment relationship includes decoding whether the contained element is in the left part of the containing element or the right part.
Claim 15
Independent Claim 36 words
The method according to any one of the preceding claims 10 to 11, wherein the step of entering symbols defining elements includes entering symbols defining lines, crosses, hooks, acute angles, dots, squares, and substantial right angles.
Claim 16
Dependent Claim 85 words
The method according to claim 1, wherein the step of entering a symbol defining a juxtaposition includes entering the symbol as a sequential pair with each symbol defining at least one element and each symbol defining at least one element defining two elements, and determining by the sequence of symbols within each pair which element is defined, and decoding the symbols defining juxtaposition with symbols defining elements in a pair, and decoding the symbol defining elements on the basis of the sequence within each pair.
Claim 17
Dependent Claim 130 words
Apparatus for transcribing ideographic or other non-alphabetic characters, including: an electrical system; first entering means for successively entering into the electrical system predetermined symbols defining at least one of the finite plurality of elements in the or each character; second entering means for successively entering into the electrical system predetermined symbols each defining one of a finite plurality of juxtapositional relationships of one of the elements to another of the elements for the or each character; a computer of variable structure structured to form decoding means coupled to said electrical system to determine the identity of each element and the position of one element relative to another element for the or each character; and readout means for transforming the decoded symbols into an assembly sensible as a character or characters.
Claim 18
Dependent Claim 130 words
Apparatus for transcribing ideographic or other non-alphabetic characters, including: an electrical system; first entering means for successively entering into the electrical system predetermined symbols defining at least one of the finite plurality of elements in the or each character; second entering means for successively entering into the electrical system predetermined symbols each defining one of a finite plurality of juxtapositional relationships of one of the elements to another of the elements for the or each character; a computer of variable structure structured to form decoding means coupled to said electrical system to determine the identity of each element and the position of one element relative to another element for the or each character; and readout means for transforming the decoded symbols into an assembly sensible as a character or characters.
Claim 19
Dependent Claim 25 words
Apparatus according to claim 16, wherein said readout means includes plotting means for plotting the elements on the basis of the decoded string of symbols.
Claim 20
Dependent Claim 41 words
Apparatus according to claim 16, wherein said readout means includes size adjusting means for adjusting the size of each of the elements on the basis of at least the number of predetermined ones of the elements in the or each character.
Claim 21
Dependent Claim 79 words
Apparatus according to claim 18, wherein said readout means further includes plotting means for plotting the elements on the basis of the decoded symbols and the size adjustment to form a character or characters, and wherein said decoding means decodes each symbol defining at least one element with a symbol defining the juxtapositional relationship as a pair, and further includes means for identifying the element in each pair on the basis of the sequence of symbols in each pair.
Claim 22
Dependent Claim 63 words
Apparatus according to claim 18 further including gross form entering means for entering a gross form symbol defining the gross form of the or each character, said decoding means including means for decoding the gross form of the symbol, and said readout means including grouping means for grouping the elements of the character and their sizes on the basis of their gross form.
Claim 23
Dependent Claim 89 words
Apparatus according to claim 18 further including gross form entering means for entering a gross form symbol before the other symbols of the or each character, said gross form symbol defining the sections into which the character is divided, said decoding means including means for decoding the gross form symbol so as to determine the section into which the character is divided, said readout means including means for determining the size of each of the elements only after the gross form symbol has been decoded by said decoding means.
Claim 24
Dependent Claim 51 words
Apparatus according to claim 16 or 21 wherein said decoding means decodes each symbol defining at least one element with a symbol defining the juxtapositional relationship as a pair, and further includes means for identifying the element in each pair on the basis of the sequence of symbols in each pair.
Claim 25
Dependent Claim 58 words
Apparatus according to claim 21, wherein said readout means includes couting means for counting predetermined ones of the elements which have been decoded in each section, while not counting predetermined others of the elements, and adjusting means for adjusting the size of the individual ones of the element on the basis of the number of the elements counted.
Claim 26
Dependent Claim 29 words
Apparatus according to claim 21, wherein said decoding means includes means for decoding the elements sequentially, and determining the juxtapositional relationship of one element to the previously decoded element.
Claim 27
Dependent Claim 124 words
Apparatus according to claim 24, wherein said second entering means includes horizontal entering means defining that the position of one element relative to a previous element is horizontally adjacent, vertical entering means defining the position of one element relative to a previous element is vertically adjacent, containment entering means defining a contained relationship between one element and a previous element, and an overwriting entering means defining that one element has an overwriting relationship with a previous element or group of elements; and wherein said decoding means includes means for determining on the basis of the symbols whether the position of one element is horizontally adjacent, vertically adjacent, has a containment relationship, or has an overwriting relationship with a previous element or groups of elements.
Claim 28
Dependent Claim 136 words
Apparatus as in claim 24, wherein said second entering means includes horiznotal entering means defining that the position of one element relative to a previous element is horizontally adjacent, vertical entering means defining the position of one element relative to a previous element is vertically adjacent, containment entering means defining a contained relationship between one element and a previous element, said containment entering means includes left indicating means indicating that the contained element is in the left part of the containing element, and right containing means indicating that the contained element is in the right part of the contained element, and wherein said decoding means includes left-right determining means for determining whether an element having a containment relationship defines whether the contained element is in the left part of the containing element or the right part.
Claim 29
Dependent Claim 70 words
Apparatus according to claim 21, wherein said second entering means includes horizontal entering means for defining that an element is horizontally adjacent another element, vertical entering means for determining that an element is vertically adjacent another element, containment entering means for defining that an element is contained relative to another element, and overwriting entering means for defining that there is an overwriting relationship with another element or group of elements.
Claim 30
Dependent Claim 85 words
Apparatus according to claim 24, 27 or 25, wherein said containment entering means includes left indicating means indicating that the contained element is in the left part of the containing element, and right containing means indicating that the contained element is in the right part of the contained element, and wherein said decoding means includes left-right determining means for determining whether an element having a containment relationship defines whether the contained element is in the left part of the containing element or the right part.
Claim 31
Dependent Claim 47 words
Apparatus according to claim 27, wherein said decoding means includes means for determining on the basis of the symbols whether the position of one element is horizontally adjacent, vertically adjacent, has a containment relationship, or has an overwriting relationship with a previous element or groups of elements.
Claim 32
Dependent Claim 61 words
Apparatus according to claim 24, 27 or 29, wherein said first entering means includes line entering means for entering lines, cross entering means for entering crosses, hook entering means for entering hooks, acute angle entering means for entering acute angles, dot entering means for entering dots, square entering means for entering squares, and right angle entering means for entering right angles.

References Cited (Backward Citations)

US3162105A Cited
US3335416A Cited
US3325786A Cited
US3444319A Cited
US3665450A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-12-25 1988-06-25 1988-12-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-12-25 1992-06-25 1992-12-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-12-25 1996-06-25 1996-12-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag