scientific article; zbMATH DE number 1059244

MaRDI QIDQ4353559zbMATH OpenFDO

Authors Howard Straubing

Publication date 10 September 1997

zbMATH Keywords

finite models in automata theorysyntactic monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(15)

• Uniform and nonuniform recognizability.
• Second-order finite automata
• Automata and finite model theory
• Using duality in circuit complexity
• Finite automata-models for the investigation of dynamical systems
• scientific article; zbMATH DE number 4049055 (Why is no real title available?)
• scientific article; zbMATH DE number 4061217 (Why is no real title available?)
• scientific article; zbMATH DE number 459361 (Why is no real title available?)
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• On the complexity of realization of finite languages by formulas
• Simulation of circuits of functional elements by the universal Turing machine
• The power of diversity
• Effective theories for circuits and automata
• scientific article; zbMATH DE number 2240006 (Why is no real title available?)
• Automata, Languages and Programming

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)