The accepting power of unary string logic programs

DOI10.1016/S0304-3975(00)00011-6zbMath0992.68126MaRDI QIDQ5958753

No author found.

Publication date: 3 March 2002

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

zbMATH Keywords

regular languageprogram transformationexpressive powerPrologfinite-state acceptor

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

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

Cites Work

• Monadic logic programs and functional complexity
• Relating logic programs and attribute grammars
• On the relationship between indexed grammars and logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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