arXiv (OAI Expanded)
open access
Fuzzy Pattern Matching in Ordered Structures
The problem of pattern matching, that is, finding all occurrences of a given pattern in a string, is one of the fundamental problems in computer science that has applications in many areas. In this paper, we consider fuzzy patterns, defined as sequences of fuzzy properties over the basic alphabet. W
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fuzzy Pattern Matching in Ordered Structures#819466
- Sorting Cayley permutations with pattern-avoiding machines#337721
- Relational Machines#3652
- A bipolar fuzzy relation equation framework for clinical decision support systems#927757
- Syntax-driven Incremental Program Verification of Matching Logic Properties#267716
Record · ID 809470
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive