321 citations
- Eötvös Loránd UniversityHU134 papers
- HUN-REN Wigner Research Centre for PhysicsHU123 papers
- Centre National de la Recherche ScientifiqueFR121 papers
- University of DebrecenHU121 papers
- Charles UniversityCZ120 papers
- Florida State UniversityUS120 papers
- Institute for High Energy PhysicsES120 papers
- Institute for Nuclear ResearchRU120 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR120 papers
- Korea UniversityKR120 papers
- Kurchatov InstituteRU120 papers
- Lawrence Livermore National LaboratoryUS120 papers
147 papers
Subsumption-Free Private-Pivot Learning in Resolvable Network-Based SAT Solving
Gábor Kusper
A resolvable network is a directed-graph representation of SAT: every SAT instance can be translated into an RN, and every RN has an associated CNF formula. Each reach represents o…
Reverse Post Correspondence Problem and Undecidability of String Assembly Systems
Benedek Nagy
The Post Correspondence Problem is as follows: having a set of dominoes, is there any (maybe repeating) sequence of them such that the words formed by the upper parts and the lower…
A Non-CDCL SAT Solver with Early Conflict Detection: The Watched-Literal-Based CSFLOC Solver
Gábor Kusper
CSFLOC is a non-CDCL SAT decision procedure based on counting subsumed full-length ordered clauses. The classical CSFLOC loop traverses the ordered space of full-length clauses by…
2-Head 2D Returning Finite Automata
Henning Fernau, Benedek Nagy, R. Jennifer Rose +2
We introduce and study a family of two-head finite automata called two head returning finite automata (2-HRFA) operating on rectangular arrays of picture languages, in which both h…
On some Classes of Reversible 2-head Automata
Benedek Nagy, Walaa Yasin
Deterministic 2-head finite automata which are machines that process an input word from both ends are analyzed for their ability to perform reversible computations. This implies th…
A Myhill-Nerode Type Characterization of 2detLIN Languages
Benedek Nagy
Linear automata are automata with two reading heads starting from the two extremes of the input, are equivalent to 5' -> 3' Watson-Crick (WK) finite automata. The heads read the in…