2001•Theoretical Computer ScienceOpen access

Formal properties of PA-matching

Satoshi Kobayashi, Víctor Mitrana, Gheorghe Pǎun, Grzegorz Rozenberg

Open full text 11 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Recursively enumerable language, Iterated function, Closure (psychology), Formal language, Hierarchy, Matching (statistics), Mathematics, Regular language

Back to paper search Browse research topics Original source

Formal properties of PA-matching — Research Paper | ScholarLens