The accepting power of unary string logic programs

DOI10.1016/S0304-3975(00)00011-6MaRDI QIDQ5958753zbMATH OpenFDO

Authors C. Runciman, Tatsuru Matsushita

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00011-6

zbMATH Keywords

expressive powerfinite-state acceptorprogram transformationPrologregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Monadic logic programs and functional complexity
• Comparing the expressive powers of some syntactically restricted classes of logic programs
• Smallest horn clause programs
• Recurrence domains: Their unification and application to logic programming
• Logic Programs for Primitive Recursive Sets

Cites work

• scientific article; zbMATH DE number 3978351 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Monadic logic programs and functional complexity
• On the relationship between indexed grammars and logic programs
• Relating logic programs and attribute grammars

Cited in

(1)

• Decidability of the Clark's completion semantics for monadic programs and queries

This page was built for publication: The accepting power of unary string logic programs

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