Pages that link to "Item:Q5538923"
From MaRDI portal
The following pages link to Generalized finite automata theory with an application to a decision problem of second-order logic (Q5538923):
Displayed 50 items.
- Reasoning about XML constraints based on XML-to-relational mappings (Q2322698) (← links)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- A link between multioperator and tree valuation automata and logics (Q2355687) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- Generalized sequential machine maps (Q2540272) (← links)
- Probabilistic tree automata and context free languages (Q2542994) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Computability by monadic second-order logic (Q2656341) (← links)
- Verification of component-based systems with recursive architectures (Q2699967) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- A Logical Characterization of Timed Pushdown Languages (Q3194716) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Stack and locally finite transformations on structures with reversible transitions (Q3332226) (← links)
- (Q3386623) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- Logics and Automata for Totally Ordered Trees (Q3522020) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints (Q3599161) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- Compact Representation for Answer Sets of n-ary Regular Queries (Q3637346) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- Regular-like tree expressions (Q3659171) (← links)
- Locally finite properties of data structures and their computation (Q3694686) (← links)
- (Q3952088) (← links)
- First-order properties of trees, star-free expressions, and aperiodicity (Q3978766) (← links)
- (Q4580330) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- Complementation of Branching Automata for Scattered and Countable N-Free Posets (Q4683231) (← links)
- A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser (Q4923565) (← links)
- From Tree Automata to Rational Tree Expressions (Q4963267) (← links)
- (Q5002820) (← links)