Results 11 to 20 of about 503 (42)
Transformers Learn Shortcuts to Automata
Algorithmic reasoning requires capabilities which are most naturally understood through recurrent models of computation, like the Turing machine. However, Transformer models, while lacking recurrence, are able to perform such reasoning using far fewer ...
Ash, Jordan T. +4 more
core
Preliminares al estudio de la huella en lingüística [PDF]
The present paper constitutes a brief advance of much longer and more detailed ongoing work on the concept of “trace” in contemporary linguistic theory, particularly in syntax. It is commonly believed that the idea was coined by Noam Chomsky. However, we
Arias Navarro, Javier
core +1 more source
The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static analysis, rapid
Dovier, Agostino +2 more
core +1 more source
Mathematical linguistics [PDF]
but in fact this is still an early draft, version 0.56, August 1 2001.
Kornai, András
core +2 more sources
Exposing Attention Glitches with Flip-Flop Language Modeling
Why do large language models sometimes output factual inaccuracies and exhibit erroneous reasoning? The brittleness of these models, particularly when executing long chains of reasoning, currently seems to be an inevitable price to pay for their advanced
Ash, Jordan T. +4 more
core
Two characterisation results of multiple context-free grammars and their application to parsing [PDF]
In the first part of this thesis, a Chomsky-Schützenberger characterisation and an automaton characterisation of multiple context-free grammars are proved. Furthermore, a framework for approximation of automata with storage is described.
Denkinger, Tobias
core +1 more source
Preliminares al estudio de la huella en lingüística [PDF]
The present paper constitutes a brief advance of much longer and more detailed ongoing work on the concept of “trace” in contemporary linguistic theory, particularly in syntax. It is commonly believed that the idea was coined by Noam Chomsky. However, we
Arias, Javier
core +1 more source
An Overview of Topological and Fuzzy Topological Hypergroupoids [PDF]
On a hypergroup, one can define a topology such that the hyperoperation is pseudocontinuous or continuous.This concepts can be extend to the fuzzy case and a connection between the classical and the fuzzy (pseudo)continuous hyperoperations can be given ...
Hosková-Mayerová, Sarka
core +1 more source
An extensive English language bibliography on graph theory and its applications [PDF]
Bibliography on graph theory and its ...
Deo, N.
core +1 more source
Impact of Membrane Computing and P Systems in ISI WoS. Celebrating the 65th Birthday of Gheorghe Păun [PDF]
Membrane Computing is a branch of Computer Science initiated by Gheorghe Păun in 1998, in a technical report of Turku Centre for Computer Science published as a journal paper ("Computing with Membranes" in Journal of Computer and System Sciences) in 2000.
Dzitac, Ioan
core +1 more source

