Relativizations for the logic-automata connection

DOI10.1007/s10990-005-7007-4zbMath1084.68064OpenAlexW2034994741MaRDI QIDQ815004

Nils Klarlund

Publication date: 8 February 2006

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-005-7007-4

zbMATH Keywords

regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Uses Software

• MONA
• Mosel

Cites Work

• MONA IMPLEMENTATION SECRETS
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relativizations for the logic-automata connection