Pages that link to "Item:Q685354"

The following pages link to On the regular structure of prefix rewriting (Q685354):

Displaying 38 items.

• Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
• On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
• Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
• An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
• On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
• Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
• Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
• Context-free event domains are recognizable (Q1286370) (← links)
• Prefix grammars: An alternative characterization of the regular languages (Q1332773) (← links)
• On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
• Process rewrite systems. (Q1854328) (← links)
• Simulation preorder over simple process algebras (Q1854513) (← links)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
• Petri nets are less expressive than state-extended PA (Q2481981) (← links)
• Computing by commuting. (Q2490820) (← links)
• Complexity results for prefix grammars (Q3025324) (← links)
• Model Checking Procedural Programs (Q3176375) (← links)
• The Reachability Problem over Infinite Graphs (Q3392937) (← links)
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
• (Q4227129) (← links)
• (Q4808743) (← links)
• Rewrite Systems with Constraints (Q4917083) (← links)
• (Q5013878) (← links)
• On rationally controlled one-rule insertion systems (Q5044416) (← links)
• Context-free event domains are recognizable (Q5096387) (← links)
• Reflections on a Geometry of Processes (Q5262964) (← links)
• Interprocedural Analysis of Concurrent Programs Under a Context Bound (Q5458333) (← links)
• Reachability Analysis of Pushdown Systems with an Upper Stack (Q5739017) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Decidability of model checking with the temporal logic EF (Q5941100) (← links)
• Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
• On the Petri net realization of context-free graphs (Q5941208) (← links)
• The regular viewpoint on PA-processes (Q5958465) (← links)
• Regular model checking: evolution and perspectives (Q6045027) (← links)
• Infinite results (Q6104374) (← links)
• Bisimulation collapse and the process taxonomy (Q6104377) (← links)