Search

Your search keyword '"Tree automaton"' showing total 1,658 results

Search Constraints

Start Over You searched for: Descriptor "Tree automaton" Remove constraint Descriptor: "Tree automaton"
1,658 results on '"Tree automaton"'

Search Results

101. Reasoning about Strategies

102. Harald Ganzinger’s Legacy: Contributions to Logics and Programming

103. Weighted Specifications over Nested Words

104. Rewrite Closure and CF Hedge Automata

105. Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking

106. Bisimulation and Coverings for Graphs and Hypergraphs

107. All for the Price of Few : (Parameterized Verification through View Abstraction)

108. Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes

109. Structural Graph Extraction from Images

110. Preliminaries

111. The Unparser

112. More Anti-chain Based Refinement Checking

113. Static Analysis of XML Document Adaptations

114. Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking

115. A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

117. Containment and Satisfiability Problem for XPath with Recursion

118. What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic

119. MSO Decidability of Multi-Pushdown Systems via Split-Width

120. Efficient Malware Detection Using Model-Checking

121. Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?

122. Weakly-Synchronized Ground Tree Rewriting : (with Applications to Verifying Multithreaded Programs)

123. Three Complementary Approaches to Bidirectional Programming

124. On Context-Free Languages of Scattered Words

125. Cooperating Distributed Tree Automata

126. On Positive TAGED with a Bounded Number of Constraints

127. Crossing the Syntactic Barrier: Hom-Disequalities for -Clauses

128. Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata

129. Monadic Datalog Containment

130. From Linear Temporal Logic Properties to Rewrite Propositions

131. Modular Tree Automata

132. Tree-Automatic Well-Founded Trees

133. Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable

134. Symbolic Tree Transducers

135. Subtyping for F-Bounded Quantifiers and Equirecursive Types

136. VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata

137. On Nominal Regular Languages with Binders

138. Extending -Clauses with Path Disequalities

139. Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints

140. Finding Finite Herbrand Models

141. Applying Tree Languages in Proof Theory

142. Visibly Pushdown Transducers with Look-Ahead

143. Optimization Techniques

144. Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism

145. Where Automatic Structures Benefit from Weighted Automata

146. Static Analysis of String Values

147. Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata

148. Controlled Term Rewriting

149. Tree Transformations and Dependencies

150. Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach

Catalog

Books, media, physical & digital resources