Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method of Merging and Incremantal Construction of Minimal Finite State Machines

a technology of finite state machines and incremantal construction, applied in the field of methods, systems and computer program products for merging and constructing finite state machines, can solve the problems of inefficiency of two-step processes, and achieve the effect of combining at least two finite state machines more efficiently

Inactive Publication Date: 2010-01-07
IBM CORP
View PDF31 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

[0009]As a result of the summarized invention, technically we have achieved a solution which merges at least two finite state machines more efficiently.

Problems solved by technology

This two-step process is not always efficient, especially in instances where a large state machine is merged with a small state machine for example, when a dictionary of words or rules is being modified by adding a new rule or word.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method of Merging and Incremantal Construction of Minimal Finite State Machines
  • Method of Merging and Incremantal Construction of Minimal Finite State Machines
  • Method of Merging and Incremantal Construction of Minimal Finite State Machines

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0016]Turning now to FIG. 1, a block diagram illustrates an exemplary computing system 100 that includes a state machine merging system in accordance with the present disclosure. The computing system 100 is shown to include a computer 101. As can be appreciated, the computing system 100 can include any computing device, including but not limited to, a desktop computer, a laptop, a server, a portable handheld device, or any other electronic device. For ease of the discussion, the disclosure will be discussed in the context of the computer 101.

[0017]The computer 101 is shown to include a processor 102, memory 104 coupled to a memory controller 106, one or more input and / or output (I / O) devices 108, 110 (or peripherals) that are communicatively coupled via a local input / output controller 112, and a display controller 114 coupled to a display 116. In an exemplary embodiment, the system 100 can further include a network interface 118 for coupling to a network 120. The network 120 transmi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A method of merging at least two state machines includes: mapping a first node from a first state machine to a second node of a second state machine to generate an input pair; performing a depth-first recursive analysis of transitions and nodes in the first state machine and the second state machine based on the input pair to construct an output node; and mapping the output node to a third state machine.

Description

BACKGROUND[0001]1. Field[0002]This disclosure relates to methods, systems, and computer program products for merging and constructing finite state machines.[0003]2. Description of Background[0004]Merging two minimal deterministic finite state machines is conventionally accomplished by a two-step process. The first step of the two-step process includes merging the two machines, which creates a non-minimal state machine. The second step of the two-step process includes minimizing the non-minimal state machine.[0005]This two-step process is not always efficient, especially in instances where a large state machine is merged with a small state machine for example, when a dictionary of words or rules is being modified by adding a new rule or word. It would be more efficient to be able to merge two state machines in a single step process.SUMMARY[0006]The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a method of merging at least t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F13/00
CPCG06F17/148G06F13/124
Inventor LAMBOV, BRANIMIR Z.
Owner IBM CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com