Find link

language:

Find link is a tool written by Edward Betts.

searching for International Journal of Foundations of Computer Science 36 found (48 total)

alternate case: international Journal of Foundations of Computer Science

TC0 (555 words) [view diff] exact match in snippet view article find links to article

"Lindström quantifiers and leaf language definability". International Journal of Foundations of Computer Science. 9 (3): 277–294. doi:10.1142/S0129054198000180

Marcus Hutter (559 words) [view diff] exact match in snippet view article find links to article

Shortest Algorithm for All Well-Defined Problems". International Journal of Foundations of Computer Science. 13 (3). World Scientific: 431–443. arXiv:cs/0206022

Distance-hereditary graph (2,290 words) [view diff] exact match in snippet view article find links to article

the clique-width of some perfect graph classes", International Journal of Foundations of Computer Science, 11 (3): 423–443, doi:10.1142/S0129054100000260

State complexity (3,375 words) [view diff] exact match in snippet view article find links to article

"Descriptional complexity of NFA of different ambiguity". International Journal of Foundations of Computer Science. 16 (5): 975–984. doi:10.1142/S0129054105003418

Logical framework (965 words) [view diff] exact match in snippet view article find links to article

the λ Π {\displaystyle \lambda \Pi } -calculus. International Journal of Foundations of Computer Science 3(3), 333-378, 1992. Specific Logical Frameworks

Non-monotonic logic (1,186 words) [view diff] exact match in snippet view article find links to article

Homomorphism Theorems to the theory of minimal models.", International Journal of Foundations of Computer Science, 01 (1), World Scientific: 49–59, doi:10.1142/S0129054190000059

First-class message (231 words) [view diff] exact match in snippet view article find links to article

First-Class Messages with Feature Constraints". International Journal of Foundations of Computer Science 11:1. François Pottier (2000). "A versatile Constraint-based

Cobham's theorem (2,522 words) [view diff] exact match in snippet view article find links to article

"A More Reasonable Proof of Cobham's Theorem". International Journal of Foundations of Computer Science. 32 (2): 203207. arXiv:1801.06704. doi:10.1142/S0129054121500118

Left-right planarity test (696 words) [view diff] exact match in snippet view article find links to article

Pierre (2006), "Trémaux trees and planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1029, arXiv:math.CO/0610935, doi:10

Depth-first search (2,447 words) [view diff] exact match in snippet view article find links to article

Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math

Paul Vitányi (571 words) [view diff] case mismatch in snippet view article find links to article

Systems; the Parallel Processing Letters; the International journal of Foundations of Computer Science; the Entropy; the Information; the SN Computer

Theory of regions (247 words) [view diff] exact match in snippet view article find links to article

(1992-12-01). "Petri nets and step transition systems". International Journal of Foundations of Computer Science. 03 (4): 443–478. doi:10.1142/S0129054192000231

Mathematical universe hypothesis (2,301 words) [view diff] exact match in snippet view article find links to article

nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer Science. 13 (4): 587–612. arXiv:quant-ph/0011122. Bibcode:2000quant

Znám's problem (1,476 words) [view diff] exact match in snippet view article find links to article

"Non-uniqueness and radius of cyclic unary NFAs", International Journal of Foundations of Computer Science, 16 (5): 883–896, doi:10.1142/S0129054105003352

Weight-balanced tree (1,944 words) [view diff] exact match in snippet view article find links to article

(2000). "A New Weight Balanced Binary Search Tree". International Journal of Foundations of Computer Science. 11 (3): 485–513. CiteSeerX 10.1.1.36.3888. doi:10

Planarity testing (1,818 words) [view diff] exact match in snippet view article find links to article

Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math

Language equation (1,105 words) [view diff] exact match in snippet view article find links to article

grammars generate non-regular unary languages". International Journal of Foundations of Computer Science. 19 (3): 597–615. doi:10.1142/S012905410800584X

Chaitin's constant (2,362 words) [view diff] exact match in snippet view article find links to article

nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer Science. 13 (4): 587–612. doi:10.1142/S0129054102001291

Computation in the limit (1,678 words) [view diff] exact match in snippet view article find links to article

nonenumerable universal measures computable in the limit", International Journal of Foundations of Computer Science, 2002, doi:10.1142/S0129054102001291. R. Soare

Post correspondence problem (2,521 words) [view diff] exact match in snippet view article find links to article

Applications for Word and Matrix Semigroups". International Journal of Foundations of Computer Science. 21 (6). World Scientific: 963–978. arXiv:0902

Hypercomputation (3,334 words) [view diff] exact match in snippet view article find links to article

nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer Science. 13 (4): 587–612. arXiv:quant-ph/0011122. Bibcode:2000quant

Solomonoff's theory of inductive inference (1,933 words) [view diff] exact match in snippet view article find links to article

universal measures computable in the limit" (PDF). International Journal of Foundations of Computer Science. 13 (4): 587–612. doi:10.1142/S0129054102001291

Clique-width (2,057 words) [view diff] exact match in snippet view article find links to article

the clique-width of some perfect graph classes", International Journal of Foundations of Computer Science, 11 (3): 423–443, doi:10.1142/S0129054100000260

Unambiguous finite automaton (1,220 words) [view diff] exact match in snippet view article find links to article

"Descriptional complexity of NFA of different ambiguity". International Journal of Foundations of Computer Science. 16 (5): 975–984. doi:10.1142/S0129054105003418

Sylvester's sequence (2,682 words) [view diff] exact match in snippet view article find links to article

"Non-uniqueness and radius of cyclic unary NFAs". International Journal of Foundations of Computer Science. 16 (5): 883–896. doi:10.1142/S0129054105003352

Conjunctive grammar (1,396 words) [view diff] exact match in snippet view article find links to article

grammars generate non-regular unary languages". International Journal of Foundations of Computer Science. 19 (3): 597–615. doi:10.1142/S012905410800584X

Tree transducer (1,625 words) [view diff] exact match in snippet view article find links to article

Equivalence Problems for Tree Transducers" (PDF). International Journal of Foundations of Computer Science. 26 (8): 1069–1100. doi:10.1142/S0129054115400134

Planar graph (4,471 words) [view diff] exact match in snippet view article find links to article

Rosenstiehl, P. (2006), "Trémaux trees and planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1029, arXiv:math/0610935, doi:10

Upward planar drawing (2,316 words) [view diff] exact match in snippet view article find links to article

tractable algorithms for testing upward planarity", International Journal of Foundations of Computer Science, 17 (5): 1095–1114, doi:10.1142/S0129054106004285

Trémaux tree (2,301 words) [view diff] exact match in snippet view article find links to article

Pierre (2006), "Trémaux trees and planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1029, arXiv:math/0610935, doi:10

Multiverse (7,373 words) [view diff] exact match in snippet view article find links to article

nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science 13 (4): 587–612. IDSIA – Dalle Molle Institute

Theory of everything (6,492 words) [view diff] exact match in snippet view article find links to article

nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer Science. 13 (4): 587–612. arXiv:quant-ph/0011122. Bibcode:2000quant

Regular expression (8,915 words) [view diff] exact match in snippet view article find links to article

Formal Study of Practical Regular Expressions". International Journal of Foundations of Computer Science. 14 (6): 1007–1018. doi:10.1142/S012905410300214X

Weak ordering (4,360 words) [view diff] exact match in snippet view article find links to article

techniques: an interesting algorithmic tool kit", International Journal of Foundations of Computer Science, 10 (2): 147–170, doi:10.1142/S0129054199000125

Closeness centrality (2,421 words) [view diff] exact match in snippet view article find links to article

"Residual Closeness and Generalized Closeness". International Journal of Foundations of Computer Science. 22 (8): 1939–1948. doi:10.1142/s0129054111009136

Speech recognition (12,457 words) [view diff] exact match in snippet view article find links to article

Automata: General Definitions and Algorithms" (PDF). International Journal of Foundations of Computer Science. 14 (6): 957–982. doi:10.1142/S0129054103002114