Some relations between Markov algorithms and formal languages

DOI10.1007/BF02576816MaRDI QIDQ1244998zbMATH OpenFDO

Authors G. Leoni, Renzo Sprugnoli

Publication date 1977

Published in Calcolo (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3506174 (Why is no real title available?)
• scientific article; zbMATH DE number 3507940 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413802 (Why is no real title available?)
• Monotone congruence algorithms
• The Markov algorithm as a language parser-linear bounds

Cited in

(1)

• scientific article; zbMATH DE number 3574987 (Why is no real title available?)

This page was built for publication: Some relations between Markov algorithms and formal languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244998)