scientific article; zbMATH DE number 1462097

MaRDI QIDQ4486016zbMATH OpenFDO

Authors Dan A. Simovici, Richard L. Tenney

Publication date 21 June 2000

zbMATH Keywords

automataChomsky hierarchyclosure propertiesdecidabilityfinite automataformal languagesgrammarslinear bounded automatapartial recursive functionpushdown automataregular and context-free languagesregular expressionsTuring machines

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4124977
• Automata Theory with Modern Applications
• scientific article; zbMATH DE number 5970650
• A Second Course in Formal Languages and Automata Theory
• scientific article; zbMATH DE number 1330031

Cited in

(12)

• Local higher-order fixpoint iteration
• Counting for satisfiability by inverting resolution
• Recent advances in formal languages and applications.
• Decidability and Specker sequences in intuitionistic mathematics
• scientific article; zbMATH DE number 3913703 (Why is no real title available?)
• scientific article; zbMATH DE number 4037247 (Why is no real title available?)
• Tree shuffle
• scientific article; zbMATH DE number 193636 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 7455743 (Why is no real title available?)
• Automata Theory with Modern Applications
• On the complexity of regular-grammars with integer attributes

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 Q4486016)