Regular canonical systems
From MaRDI portal
Publication:5338328
Cites work
- Formal Reductions of the General Combinatorial Decision Problem
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3062117 (Why is no real title available?)
- Realization of Events by Logical Nets
- Recursive unsolvability of a problem of Thue
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(49)- Reachability is decidable for weakly extended process rewrite systems
- On coordinated selective substitutions: Towards a unified theory of grammars and machines
- Recording the use of memory in right-boundary grammars and push-down automata
- On the active and full use of memory in right-boundary grammars and push- down automata
- Absorption relation on regular sets
- On termination problems for finitely interpreted ALGOL-like programs
- On procedures as open subroutines. II
- Intercalation lemmas for tree transducer languages
- A unified approach to the generation and the acception of formal languages
- On the transition graphs of Turing machines.
- On the symbolic reduction of processes with cryptographic functions.
- On infinite transition graphs having a decidable monadic theory
- Derivation trees of ground term rewriting systems.
- Canonical systems
- Computational power of two stacks with restricted communication
- Automata on finite trees
- Faster pushdown reachability analysis with applications in network verification
- Computing by commuting.
- Generalized sequential machine maps
- Application of regular canonical systems to grammars translatable from left to right
- Stable canonical rules
- Complexity results for prefix grammars
- SAT-Based Model Checking
- Comparison of basic language generating devices (non-deterministic systems)
- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
- Pure grammars and pure languages†
- On jump-deterministic pushdown automata
- Parsers for indexed grammars
- Regular bilinear systems
- scientific article; zbMATH DE number 3795408 (Why is no real title available?)
- Tree-stack automata
- Optimal strategies in pushdown reachability games
- Visibly pushdown languages over sliding windows
- On regular expressions and regular canonical systems
- A Note on Pushdown Store Automata and Regular Systems
- Canonical systems which produce periodic sets
- The regular viewpoint on PA-processes
- Bisimulation collapse and the process taxonomy
- Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
- On the complexity of multi-pushdown games
- On the regular structure of prefix rewriting
- Containment of regular path queries under path constraints
- Deleting string rewriting systems preserve regularity
- Reachability in trace-pushdown systems
- Object-oriented data via prefix rewriting. I: Overview and main results
- Pushdown Systems
- Generalized parenthesis languages and minimization of their parenthesis parts
- Decidability issues for extended ping-pong protocols
- An efficient automata approach to some problems on context-free grammars.
This page was built for publication: Regular canonical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338328)
