Results 11 to 20 of about 12,979 (182)
Unambiguous Separators for Tropical Tree Automata [PDF]
, 2019 In this paper we show that given a max-plus automaton (over trees, and with real weights) computing a function f and a min-plus automaton (similar) computing a function g such that f ?
Colcombet, Thomas, Lombardy, Sylvain
core +3 more sources
XML Compression via DAGs [PDF]
, 2013 Unranked trees can be represented using their minimal dag (directed acyclic graph). For XML this achieves high compression ratios due to their repetitive mark up. Unranked trees are often represented through first child/next sibling (fcns) encoded binary
Bousquet-Melou, Mireille +3 more
core +1 more source
Regular tree languages, cardinality predicates, and addition-invariant FO [PDF]
, 2011 This paper considers the logic FOcard, i.e., first-order logic with cardinality predicates that can specify the size of a structure modulo some number.
Harwath, Frederik, Schweikardt, Nicole
core +3 more sources
On an algorithm to decide whether a free group is a free factor of another [PDF]
, 2006 We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F.
Silva, Pedro, Weil, Pascal
core +4 more sources
Building Efficient and Compact Data Structures for Simplicial Complexes [PDF]
, 2016 The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes.
Boissonnat, Jean-Daniel +2 more
core +4 more sources
Weak MSO+U with Path Quantifiers over Infinite Trees
, 2014 This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths.
M. Bojańczyk +10 more
core +1 more source
Sampled Semantics of Timed Automata [PDF]
, 2010 Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing ...
Abdulla, Parosh Aziz +2 more
core +3 more sources
Can Nondeterminism Help Complementation?
, 2012 Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Aniello Murano +26 more
core +2 more sources
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]
, 2013 We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Barguñó, Luis +4 more
core +6 more sources
Microstructure Evolution of a VMnFeCoNi High‐Entropy Alloy After Synthesis, Swaging, and Annealing
Advanced Engineering Materials, EarlyView.The synthesis and processing (rotary swaging and annealing) of the novel VMnFeCoNi alloy is investigated, alongside the estimation of the grain size effect on hardness. Analysis of a wide grain size range of recrystallized microstructures (12–210 µm) reveals a low annealing twin density.
Aditya Srinivasan Tirunilai +6 more
wiley +1 more source