Works matching IS 01290541 AND DT 2021 AND VI 32 AND IP 2
Results: 7
Graph Orientation with Edge Modifications.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 209, doi. 10.1142/S012905412150012X
- By:
- Publication type:
- Article
A More Reasonable Proof of Cobham's Theorem.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 203, doi. 10.1142/S0129054121500118
- By:
- Publication type:
- Article
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 175, doi. 10.1142/S0129054121500106
- By:
- Publication type:
- Article
A Proof of Parikh's Theorem via Dickson's Lemma.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 163, doi. 10.1142/S012905412150009X
- By:
- Publication type:
- Article
Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 151, doi. 10.1142/S0129054121500088
- By:
- Publication type:
- Article
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 137, doi. 10.1142/S0129054121500076
- By:
- Publication type:
- Article
Triple Cyclic Codes Over 𝔽q+u𝔽q.
- Published in:
- International Journal of Foundations of Computer Science, 2021, v. 32, n. 2, p. 115, doi. 10.1142/S0129054121500064
- By:
- Publication type:
- Article