The following pages link to Regular canonical systems (Q5338328):
Displaying 40 items.
- Parallel communicating grammar systems with regular control and skeleton preserving FRR automata (Q620962) (← links)
- On the regular structure of prefix rewriting (Q685354) (← links)
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- Generalized parenthesis languages and minimization of their parenthesis parts (Q800093) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- On coordinated selective substitutions: Towards a unified theory of grammars and machines (Q1081311) (← links)
- Recording the use of memory in right-boundary grammars and push-down automata (Q1099636) (← links)
- On the active and full use of memory in right-boundary grammars and push- down automata (Q1099637) (← links)
- Absorption relation on regular sets (Q1147513) (← links)
- On termination problems for finitely interpreted ALGOL-like programs (Q1161274) (← links)
- On procedures as open subroutines. II (Q1216944) (← links)
- Intercalation lemmas for tree transducer languages (Q1237574) (← links)
- A unified approach to the generation and the acception of formal languages (Q1241067) (← links)
- On the transition graphs of Turing machines. (Q1401268) (← links)
- On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
- On infinite transition graphs having a decidable monadic theory (Q1853615) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Automata on finite trees (Q2074209) (← links)
- Faster pushdown reachability analysis with applications in network verification (Q2147193) (← links)
- Computing by commuting. (Q2490820) (← links)
- Generalized sequential machine maps (Q2540272) (← links)
- Application of regular canonical systems to grammars translatable from left to right (Q2562695) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Comparison of basic language generating devices (non-deterministic systems) (Q3484359) (← links)
- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order (Q3646258) (← links)
- Pure grammars and pure languages† (Q3902533) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- Parsers for indexed grammars (Q4187334) (← links)
- Tree-stack automata (Q4879207) (← links)
- (Q5005144) (← links)
- (Q5090478) (← links)
- On regular expressions and regular canonical systems (Q5569116) (← links)
- A Note on Pushdown Store Automata and Regular Systems (Q5573974) (← links)
- Canonical systems which produce periodic sets (Q5582344) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
