Syntactic recognizability of graphs with fuzzy attributes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3692668 (Why is no real title available?)
- scientific article; zbMATH DE number 107486 (Why is no real title available?)
- scientific article; zbMATH DE number 3492732 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3607504 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- A logic on subobjects and recognizability
- An axiomatization of graphs
- Context-free graph grammars and concatenation of graphs
- Fuzzification of rational and recognizable sets
- Fuzzy cognitive maps
- Fuzzy cognitive maps. Advances in theory, methodologies, tools and applications
- Fuzzy graphs and fuzzy hypergraphs
- Fuzzy regular languages over finite and infinite words
- Fuzzy tree automata
- Fuzzy tree language recognizability
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
- Graph automata
- Infinite fuzzy computations
- Minimization of fuzzy finite automata
- Non deterministic recognizability of fuzzy languages
- On the recognizability of fuzzy languages. I
- On the recognizability of fuzzy languages. II
- Recognizability of graph and pattern languages
- The Syntactic Complexity of Eulerian Graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The recognizability of sets of graphs is a robust property
Cited in
(3)
This page was built for publication: Syntactic recognizability of graphs with fuzzy attributes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445984)