scientific article; zbMATH DE number 3313290

zbMath0196.52501MaRDI QIDQ5593685

R. J. Evey

Publication date: 1963

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computer science and automata

Related Items (26)

One-counter pushdown-storage automata as transducers of sequences ⋮ Quasi-realtime languages ⋮ Unnamed Item ⋮ Parsing schemata and correctness of parsing algorithms ⋮ A Note on Pushdown Store Automata and Regular Systems ⋮ Stochastic grammars and languages ⋮ An infinite hierarchy of intersections of context-free languages ⋮ Transformational-generative grammar for description of formal properties ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ Unnamed Item ⋮ On translating Lambek grammars with one division into context-free grammars ⋮ On the degrees of non-regularity and non-context-freeness ⋮ A generalization of leftmost derivations ⋮ Translation grammars for compilation and decompilation ⋮ Periodic properties of autonomous automata with pushdown storage ⋮ Periodic properties of pushdown automata ⋮ Some definitional suggestions for automata theory ⋮ An algebraic technique for context-sensitive parsing ⋮ Control sets on grammars using depth-first derivations ⋮ On stochastic context-free languages ⋮ Verbandstheoretische Einbettung von Klassen unwesentlich verschiedener Ableitungen in die Zopfgruppe. (Lattice theoretical embedding of classes of unessentially different derivations into the braid group) ⋮ A characterization of semilinear sets ⋮ Pushdown automata with counters ⋮ On the relation between the class of all context-free languages and the class of deterministic context-free languages ⋮ Minimization of the complexity function in the class of pushdown store automata and categorial grammars of complexity three ⋮ Control sets on grammars

This page was built for publication: