1,658 results on '"Tree automaton"'
Search Results
2. Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
3. Probability Distributions in Type Theory with Applications in Natural Language Syntax
4. Equivalence of Probabilistic -Calculus and p-Automata
5. On the Regularity and Learnability of Ordered DAG Languages
6. An Automata View to Goal-Directed Methods
7. Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data
8. Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in
9. Counterexample Validation and Interpolation-Based Refinement for Forest Automata
10. Random tree recursions: Which fixed points correspond to tangible sets of trees?
11. Operations on Unambiguous Finite Automata
12. Uniformization on Thin Trees
13. When a Thin Language Is Definable in wmso
14. When a Büchi Language Is Definable in wmso
15. Basic Notions
16. Reduction of Nondeterministic Tree Automata
17. Synchronizing Automata over Nested Words
18. Tree Compression Using String Grammars
19. On Parity Game Preorders and the Logic of Matching Plays
20. A General Modular Synthesis Problem for Pushdown Systems
21. Challenges for Efficient Query Evaluation on Structured Probabilistic Data
22. Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems
23. Bounded Cycle Synthesis
24. Decision Problems for Finite Automata over Infinite Algebraic Structures
25. Near-Optimal Scheduling for LTL with Future Discounting
26. Decidability and Expressivity of Ockhamist Propositional Dynamic Logics
27. Equivalence-Based Abstraction Refinement for HORS Model Checking
28. Synthesizing Skeletons for Reactive Systems
29. Learning Tree Languages
30. Learning Grammars and Automata with Queries
31. On CTL* with Graded Path Modalities
32. On the Weak Index Problem for Game Automata
33. Provenance Circuits for Trees and Treelike Instances
34. Containment of Monadic Datalog Programs via Bounded Clique-Width
35. On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
36. Symmetric Strategy Improvement
37. On Determinisation of Good-for-Games Automata
38. Decision Problems of Tree Transducers with Origin
39. Forester: Shape Analysis Using Tree Automata : (Competition Contribution)
40. Nested Antichains for WS1S
41. Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information
42. Typing Weak MSOL Properties
43. The Computational Contents of Ramified Corecurrence
44. Composing Message Translators and Inferring Their Data Types Using Tree Automata
45. Cooperative Reactive Synthesis
46. Over-Approximating Terms Reachable by Context-Sensitive Rewriting
47. Reducing Bounded Realizability Analysis to Reachability Checking
48. A Tableau for Bundled Strategies
49. Capturing MSO with One Quantifier
50. Non-cooperative Algorithms in Self-assembly
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.