Moore reducibility for regular languages

zbMATH Open1203.68083MaRDI QIDQ3399031FDOQ3399031

Authors: Paul Cull 

Publication date: 29 September 2009

Full work available at URL: http://www.jams.or.jp/scm/abstract/e-2009/2009-42a.txt

Recommendations

• New Computational Paradigms
• Hierarchies and reducibilities on regular languages related to modulo counting
• scientific article; zbMATH DE number 3907802
• Semi-linear Parikh Images of Regular Expressions via Reduction
• Mathematical Foundations of Computer Science 2004

zbMATH Keywords

complete setsregular setsMoore automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Title not available (Why is that?)
• New Computational Paradigms
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Moore reducibility for regular languages

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