Fundamental methodological issues of syntactic pattern recognition
From MaRDI portal
Publication:903109
DOI10.1007/s10044-013-0322-1zbMath1328.68101OpenAlexW2037625638WikidataQ59399363 ScholiaQ59399363MaRDI QIDQ903109
Mariusz Flasiński, Janusz Jurek
Publication date: 5 January 2016
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10044-013-0322-1
Cites Work
- Parsing of edNLC-graph grammars for scene analysis
- Power properties of NLC graph grammars with a polynomial membership problem
- On the structure of node-label-controlled graph languages
- Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
- Tree adjunct grammars
- Boolean grammars
- Medical image unstanding technology. Artificial intelligence and soft-computing for image understanding.
- A Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages
- Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
- The equivalence of four extensions of context-free grammars
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Sequentially Indexed Grammars
- Semantics of context-free languages
- Indexed Grammars—An Extension of Context-Free Grammars
- Programmed Grammars and Classes of Formal Languages
- Properties of deterministic top-down grammars
- A Minimum Distance Error-Correcting Parser for Context-Free Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fundamental methodological issues of syntactic pattern recognition
