Regular canonical systems
From MaRDI portal
Publication:5338328
DOI10.1007/BF01969548zbMath0129.26102OpenAlexW4232505977MaRDI QIDQ5338328
Publication date: 1964
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137766
Related Items
On coordinated selective substitutions: Towards a unified theory of grammars and machines, On regular expressions and regular canonical systems, SAT-Based Model Checking, Canonical systems which produce periodic sets, Faster pushdown reachability analysis with applications in network verification, 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, Decidability issues for extended ping-pong protocols, Comparison of basic language generating devices (non-deterministic systems), Parallel communicating grammar systems with regular control and skeleton preserving FRR automata, Bisimulation collapse and the process taxonomy, A Note on Pushdown Store Automata and Regular Systems, On the transition graphs of Turing machines., A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct, Absorption relation on regular sets, Unnamed Item, On termination problems for finitely interpreted ALGOL-like programs, Computational power of two stacks with restricted communication, Tree-stack automata, An efficient automata approach to some problems on context-free grammars., On the regular structure of prefix rewriting, Complexity results for prefix grammars, Deleting string rewriting systems preserve regularity, On procedures as open subroutines. II, Computing by commuting., On jump-deterministic pushdown automata, Unnamed Item, Intercalation lemmas for tree transducer languages, A unified approach to the generation and the acception of formal languages, The regular viewpoint on PA-processes, Parsers for indexed grammars, Pure grammars and pure languages†, Reachability is decidable for weakly extended process rewrite systems, Generalized sequential machine maps, Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order, Automata on finite trees, Application of regular canonical systems to grammars translatable from left to right, 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., Generalized parenthesis languages and minimization of their parenthesis parts
Cites Work
