Search Results - "Sadri F"

The British Nationality Act as a logic program.

Authors: Sergot, M. J. Sadri, F. Kowalski, R. A.

Source: Communications of the ACM; May 1986, Vol. 29, p370-386, 17p

On unique, multiset, and set decipherability of three-word codes.

Authors: Blanchet-Sadri, F.

Source: IEEE Transactions on Information Theory; July 2001, Vol. 47 Issue 5, p1745-1757, 13p

Template dependencies.

Authors: Sadri, F. Ullman, J. D.

Source: Journal of the ACM; April 1982, Vol. 29, p363-372, 10p

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.

Authors: Blanchet-Sadri, F. Bodnar, Michelle Winkle, Benjamin

Source: Theory of Computing Systems; Apr2017, Vol. 60 Issue 3, p473-497, 25p

COMPUTING DEPTHS OF PATTERNS.

Authors: BLANCHET-SADRI, F. LOHR, ANDREW

Source: RAIRO - Theoretical Informatics & Applications; 2016, Vol. 50 Issue 2, p117-133, 17p, 1 Chart

Abelian pattern avoidance in partial words.

Authors: Blanchet-Sadri, F. De Winkle, Benjamin Simmons, Sean

Source: RAIRO - Theoretical Informatics & Applications; Jul2014, Vol. 48 Issue 3, p315-00339, 25p

Avoidable binary patterns in partial words.

Authors: Blanchet-Sadri, F. Mercaş, Robert Simmons, Sean et al.

Source: Acta Informatica; Feb2011, Vol. 48 Issue 1, p25-41, 17p

Unavoidable Sets of Partial Words.

Authors: Blanchet-Sadri, F. Brownstein, N. C. Kalcic, Andy et al.

Source: Theory of Computing Systems; Aug2009, Vol. 45 Issue 2, p381-406, 26p

ON DESIGN PRINCIPLES FOR A MOLECULAR COMPUTER.

Authors: Sergot, M.J. Sadri, F. Kowalski, R.A. et al.

Source: Communications of the ACM. May85, Vol. 28 Issue 5, p464-480. 17p. 3 Diagrams, 2 Charts.

Subjects: Citizenship, Logic programming

Geographic Terms: United Kingdom

On a Product of Finite Monoids.

Authors: Blanchet-Sadri, F. Gaddis, F. Dale

Source: Semigroup Forum. 1998, Vol. 57 Issue 1, p75. 17p.

Equations on Semidirect Products of Commutative Semigroups.

Authors: Blanchet-Sadri, F.

Source: Semigroup Forum. 1997, Vol. 55 Issue 1, p80. 9p.

Equations on the semidirect product of a finite semilattice by a finite commutative monoid.

Authors: Blanchet-Sadri, F. Zhang, Xin-Hong

Source: Semigroup Forum. 1994, Vol. 49 Issue 1, p67-81. 15p.

Equations and dot-depth one.

Authors: Blanchet-Sadri, F.¹ blanchet@steffi.acc.uncg.edu

Source: Semigroup Forum. 1993, Vol. 47 Issue 1, p305-317. 13p.

Computing generalized de Bruijn sequences.

Authors: Blanchet-Sadri, F. Munteanu, Sinziana

Source: Theoretical Computer Science. Dec2017, Vol. 704, p42-61. 20p.

Subjects: De Bruijn graph, Polynomial time algorithms, Combinatorics, Graph theory, Algorithms

Computing abelian complexity of binary uniform morphic words.

Authors: Blanchet-Sadri, F. Seita, Daniel Wise, David

Source: Theoretical Computer Science. Aug2016, Vol. 640, p41-51. 11p.

Subjects: Computational complexity, Mathematic morphism, Abelian categories, Fixed point theory, Iterative methods (Mathematics), Algorithms, Permutations

Combinatorics on partial word borders.

Authors: Allen, Emily Blanchet-Sadri, F. Bodnar, Michelle et al.

Source: Theoretical Computer Science. Jan2016 Part 2, Vol. 609, p469-493. 25p.

Subjects: Combinatorics, Graph theory, Set theory, Mathematical sequences, Number theory

Computing minimum length representations of sets of words of uniform length.

Authors: Blanchet-Sadri, F. Lohr, Andrew

Source: Theoretical Computer Science. Sep2015, Vol. 596, p41-54. 14p.

Subjects: Data compression, Problem solving, Polynomials, Graph theory, Algorithms

Computing primitively-rooted squares and runs in partial words.

Authors: Blanchet-Sadri, F. Lazarow, J. Nikkel, J. et al.

Source: European Journal of Combinatorics. Feb2018, Vol. 68, p223-241. 19p.

Border correlations, lattices, and the subgraph component polynomial.

Authors: Blanchet-Sadri, F. Cordier, M. Kirsch, R.

Source: European Journal of Combinatorics. Feb2018, Vol. 68, p204-222. 19p.

Squares and primitivity in partial words.

Authors: Blanchet-Sadri, F. Bodnar, Michelle Nikkel, Jordan et al.

Source: Discrete Applied Mathematics. Apr2015, Vol. 185, p26-37. 12p.

Subjects: Graph theory, Paths & cycles in graph theory, Polynomials, Undirected graphs, Mathematical bounds, Number theory