scientific article; zbMATH DE number 1059244

zbMATH Open0880.68092MaRDI QIDQ4353559FDOQ4353559

Howard Straubing

Publication date: 10 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 459361
• scientific article; zbMATH DE number 618821
• scientific article; zbMATH DE number 988809

zbMATH Keywords

syntactic monoidfinite models in automata theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• Title not available (Why is that?)
• Uniform and nonuniform recognizability.
• Automata and finite model theory
• Title not available (Why is that?)
• Simulation of circuits of functional elements by the universal Turing machine
• Finite automata-models for the investigation of dynamical systems
• Effective theories for circuits and automata
• Title not available (Why is that?)
• Automata, Languages and Programming
• On the complexity of realization of finite languages by formulas
• Title not available (Why is that?)

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