Results 101 to 110 of about 1,221 (189)

On dots in boxes, or Permutation pattern classes and regular languages

, 2015
This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We found that the subsets of plus- and minus-(in)decomposable permutations of
Hoffmann, Ruth
core  

The computational origin of representation. [PDF]

Minds Mach (Dordr), 2021
Piantadosi ST.
europepmc   +1 more source

Golem: a flexible and efficient solver for constrained Horn clauses. [PDF]

Form Methods Syst Des
Blicha M, Britikov K, Sharygina N.
europepmc   +1 more source

On Polynomial Recursive Sequences. [PDF]

Theory Comput Syst
Cadilhac M, Mazowiecki F, Paperman C, Pilipczuk M, Sénizergues G.   +4 more
europepmc   +1 more source

Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]

SIAM J Discret Math, 2020
Mansour T, Rastegar R, Roitershtein A.
europepmc   +1 more source

Quantum Automata and Quantum Grammars

, 2008
. To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars. We

core  

Probabilistic parsing

, 2011
Satta, Giorgio, Nederhof, Mark Jan
core   +1 more source

The Future of Computational Linguistics: On Beyond Alchemy. [PDF]

Front Artif Intell, 2021
Church K, Liberman M.
europepmc   +1 more source