scientific article; zbMATH DE number 1930741

MaRDI QIDQ4710019zbMATH OpenFDO

Authors Daowen Qiu

Publication date 2003

zbMATH Keywords

formal languagepumping lemma

Mathematics Subject Classification ID

Quantum logic (03G12) Formal languages and automata (68Q45) Quantum computation (81P68)

Recommendations

• Quantum automata and quantum grammars
• Automata theory based on quantum logic. I
• Automata theory based on quantum logic. II.
• Quantum logic and automata theory
• Automata theory based on quantum logic: Some characterizations
• Automata theory based on quantum logic: recognizability and accessibility
• Pushdown automata and context-free grammars based on quantum logic
• SOFSEM 2006: Theory and Practice of Computer Science
• Grammar theory based on quantum logic

Cited in

(13)

• Weakly regular quantum grammars and asynchronous quantum automata
• Grammar theory based on quantum logic
• Quantum automata and quantum grammars
• Notes on automata theory based on quantum logic
• Automata theory based on quantum logic: recognizability and accessibility
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Finite state and finite stop quantum languages
• Pushdown automata and context-free grammars based on quantum logic
• scientific article; zbMATH DE number 1819956 (Why is no real title available?)
• A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
• Quantum aspects of semantic analysis and symbolic artificial intelligence
• Computing power of Turing machines in the framework of unsharp quantum logic
• The computing power of Turing machine based on quantum logic

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