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 29 items.
- Bottom-Up derivatives of tree expressions (Q5021108) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- Feature automata and recognizable sets of feature trees (Q5044748) (← links)
- (Q5089180) (← links)
- (Q5089205) (← links)
- (Q5090498) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- MSO definable text languages (Q5096900) (← links)
- Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- Fly-Automata, Their Properties and Applications (Q5200070) (← links)
- On reverse and general definite tree languages (Q5204314) (← links)
- (Q5207048) (← links)
- Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)
- Cascade Products and Temporal Logics on Finite Trees (Q5262961) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- (Q5576262) (← links)
- Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data (Q5738985) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- (Q5871579) (← links)
- Logic and rational languages of scattered and countable series-parallel posets (Q5919278) (← links)
- Symbolic model checking with rich assertional languages (Q5941102) (← links)
- The component hierarchy of chain-free cooperating distributed regular tree grammars (Q5958121) (← links)
- Incremental reasoning on monadic second-order logics with logic programming (Q5963088) (← links)
- Stone duality, topological algebra, and recognition. (Q5964103) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
- Solving the Weighted HOM-Problem With the Help of Unambiguity (Q6204136) (← links)