The following pages link to (Q3999156):
Displaying 42 items.
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- A power-set construction for reducing Büchi automata to non-determinism degree two (Q845908) (← links)
- A field guide to equational logic (Q1201350) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- Incorporating decision procedures in implicit induction. (Q1404422) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- Iterating transducers (Q1858440) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Computation on abstract data types. The extensional approach, with an application to streams (Q1923575) (← links)
- Intersection of \(-\omega \)-regular expressions (Q2058685) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Dependent vector types for data structuring in multirate Faust (Q2275532) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- On the König deficiency of zero-reducible graphs (Q2292142) (← links)
- Formal Methods to Improve Public Administration Business Processes (Q2889178) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (Q3449478) (← links)
- Development closed critical pairs (Q4645811) (← links)
- Proof-theoretic notions for software maintenance (Q4923374) (← links)
- Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* (Q4988927) (← links)
- COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY (Q5024502) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- Recursively defined tree transductions (Q5055806) (← links)
- A termination ordering for higher order rewrite systems (Q5055816) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
- Higher-order families (Q5055875) (← links)
- Set-theoretic graph rewriting (Q5096290) (← links)
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time (Q5096738) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- Formal composition of hybrid systems (Q5129226) (← links)
- Asynchronous cellular automata for infinite traces (Q5204349) (← links)
- Polishness of some topologies related to word or tree automata (Q5376660) (← links)
- (Q5389686) (← links)
- Confluence without termination via parallel critical pairs (Q5878911) (← links)
- A maximal-literal unit strategy for horn clauses (Q5881264) (← links)
- A graphic language based on timing diagrams (Q5955785) (← links)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)