scientific article; zbMATH DE number 1178947

MaRDI QIDQ4398765zbMATH OpenFDO

Authors John Martin

Publication date 26 July 1998

zbMATH Keywords

computational complexitycontext-free languagesfinite automatapushdown automataregular languagesTuring machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42)

Recommendations

• An Introduction to Formal Languages and Machine Computation
• scientific article; zbMATH DE number 805390
• scientific article; zbMATH DE number 1729953
• scientific article; zbMATH DE number 3909745
• scientific article; zbMATH DE number 43003
• scientific article; zbMATH DE number 193283
• Languages, machines, and classical computation
• scientific article; zbMATH DE number 4075029
• Introduction to theoretical computer science. Formal languages and automata.
• Introduction to theoretical computer science. Formal languages and automata.

Cited in

(25)

• scientific article; zbMATH DE number 193636 (Why is no real title available?)
• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• Uniformly most powerful test with two-dimensional minimal sufficient statistic
• scientific article; zbMATH DE number 43003 (Why is no real title available?)
• Understanding Computation
• Signed real measure of regular languages for discrete-event automata
• scientific article; zbMATH DE number 107969 (Why is no real title available?)
• A language measure for supervisory control
• A Second Course in Formal Languages and Automata Theory
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• Discrete structures and automata theory
• Introducing the theory of computation
• Languages, machines, and classical computation
• Theory of computation.
• An introduction to formal languages and automata.
• scientific article; zbMATH DE number 1729953 (Why is no real title available?)
• Concise guide to computation theory.
• Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
• scientific article; zbMATH DE number 2021769 (Why is no real title available?)
• Elements of computation theory
• A concise introduction to languages and machines
• Lectures on computer science. Vol. 3: Computability, formal languages, specifications
• Automata and computability. A programmer's perspective
• Formal languages and computation. Models and their applications
• Introduction to theoretical computer science. Formal languages and automata.

This page was built for publication:

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