The Markov algorithm as a language parser-linear bounds

DOI10.1016/S0022-0000(72)80014-XzbMATH Open0247.68030MaRDI QIDQ2556085FDOQ2556085

Authors: Jacob Katzenelson 

Publication date: 1972

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Some relations between Markov algorithms and formal languages
• AEPL: An extensible programming language†
• Title not available (Why is that?)

This page was built for publication: The Markov algorithm as a language parser-linear bounds

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