scientific article; zbMATH DE number 3574987

zbMath0368.68056MaRDI QIDQ4144800

Martine Paget

Publication date: 1978

Full work available at URL: https://eudml.org/doc/92061

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Turing machines and related notions (03D10) Algorithms in computer science (68W99)

Related Items

Unnamed Item

Uses Software

• SNOBOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some relations between Markov algorithms and formal languages
• Time bounded random access machines
• PANON-1B: A programming language for symbol manipulation
• The Markov algorithm as a language parser-linear bounds
• On a Subrecursive Hierarchy and Primitive Recursive Degrees
• Classes of Predictably Computable Functions
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational Complexity of One-Tape Turing Machine Computations
• An associative parallel processing system for non-numerical computation
• SNOBOL , A String Manipulation Language