On the regular structure of prefix rewriting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4035115 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 3716825 (Why is no real title available?)
- scientific article; zbMATH DE number 139799 (Why is no real title available?)
- scientific article; zbMATH DE number 176493 (Why is no real title available?)
- scientific article; zbMATH DE number 4124985 (Why is no real title available?)
- scientific article; zbMATH DE number 1142313 (Why is no real title available?)
- Hyperedge replacement: grammars and languages
- Regular canonical systems
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- The theory of ends, pushdown automata, and second-order logic
Cited in
(47)- An efficient automata approach to some problems on context-free grammars.
- scientific article; zbMATH DE number 7438568 (Why is no real title available?)
- Context-free event domains are recognizable
- Properties and limits of recognition of sets of integers by countable automata
- Model checking procedural programs
- Complexity results for prefix grammars
- scientific article; zbMATH DE number 1254101 (Why is no real title available?)
- scientific article; zbMATH DE number 125883 (Why is no real title available?)
- On the Petri net realization of context-free graphs
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Prefix grammars: An alternative characterization of the regular languages
- On Bifix Systems and Generalizations
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- On the complexity of a family of \(k\)-context-free sequences
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- Intruder deduction for the equational theory of abelian groups with distributive encryption
- On rationally controlled one-rule insertion systems
- On complexity functions of infinite words associated with generalized Dyck languages
- Decidability of model checking with the temporal logic EF
- Bisimulation collapse and the process taxonomy
- Deciding bisimulation-like equivalences with finite-state processes
- Context-free event domains are recognizable
- scientific article; zbMATH DE number 2090069 (Why is no real title available?)
- Reachability analysis of pushdown systems with an upper stack
- Reflections on a Geometry of Processes
- Reachability is decidable for weakly extended process rewrite systems
- Transition Graphs of Rewriting Systems over Unranked Trees
- Rewrite systems with constraints
- Computing by commuting.
- Decidability of bisimulation equivalence for normed pushdown processes
- Regularity and context-freeness over word rewriting systems
- Prefix rewriting for nested-words and collapsible pushdown automata
- scientific article; zbMATH DE number 1512609 (Why is no real title available?)
- Process rewrite systems.
- On the computational complexity of bisimulation, redux
- Simulation preorder over simple process algebras
- Petri nets are less expressive than state-extended PA
- The regular viewpoint on PA-processes
- On the symbolic reduction of processes with cryptographic functions.
- Logical aspects of Cayley-graphs: the group case
- Regular model checking: evolution and perspectives
- Infinite results
- The Reachability Problem over Infinite Graphs
- scientific article; zbMATH DE number 1405695 (Why is no real title available?)
- Pushdown automata, multiset automata, and Petri nets
- Decidability of bisimulation equivalence for normed pushdown processes
- scientific article; zbMATH DE number 139799 (Why is no real title available?)
This page was built for publication: On the regular structure of prefix rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685354)
