[go: up one dir, main page]

Ivanov et al., 2015 - Google Patents

Universality of graph-controlled leftist insertion-deletion systems with two states

Ivanov et al., 2015

View PDF
Document ID
9883354085923310391
Author
Ivanov S
Verlan S
Publication year
Publication venue
International Conference on Machines, Computations, and Universality

External Links

Snippet

In this article, we consider leftist insertion-deletion systems, in which all rules have contexts on the same side, and may only insert or delete one symbol at a time. We start by introducing extended rules, in which the contexts may be specified as regular expressions …
Continue reading at ndl.ethernet.edu.et (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30964—Querying
    • G06F17/30979—Query processing
    • G06F17/30985—Query processing by using string matching techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/27—Automatic analysis, e.g. parsing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/44—Arrangements for executing specific programmes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
US6944588B2 (en) Method and apparatus for factoring unambiguous finite state transducers
Enaganti et al. On the overlap assembly of strings and languages
Fernau et al. On path-controlled insertion–deletion systems
US20030004705A1 (en) Method and apparatus for factoring ambiguous finite state transducers
Ivanov et al. Random context and semi-conditional insertion-deletion systems
Ivanov et al. Universality of graph-controlled leftist insertion-deletion systems with two states
Kwee et al. On the effects of nondeterminism on ordered restarting automata
Ivanov et al. Universality and computational completeness of controlled leftist insertion-deletion systems
Fernau et al. Graph-controlled insertion-deletion systems generating language classes beyond linearity
US20030033135A1 (en) Method and apparatus for extracting infinite ambiguity when factoring finite state transducers
Fernau et al. Descriptional complexity of graph-controlled insertion-deletion systems
Fernau et al. Computational completeness of simple semi-conditional insertion-deletion systems
Pshenitsyn Powerful and NP-complete: hypergraph Lambek grammars
Kim et al. Efficient enumeration of regular expressions for faster regular expression synthesis
Ivanov et al. About one-sided one-symbol insertion-deletion P systems
Vorel Two results on discontinuous input processing
Okhotin et al. Edit distance neighbourhoods of input-driven pushdown automata
Fernau et al. Computational completeness of path-structured graph-controlled insertion-deletion systems
US6760636B2 (en) Method and apparatus for extracting short runs of ambiguity from finite state transducers
Ivanov et al. Single semi-contextual insertion-deletion systems
Gazdag et al. On the power of permitting semi-conditional grammars
Mohri et al. On the disambiguation of weighted automata
Rubtsov et al. On computational complexity of set automata
US20020198702A1 (en) Method and apparatus for factoring finite state transducers with unknown symbols
Kutrib et al. Input-driven queue automata with internal transductions