Second-order finite automata: expressive power and simple proofs using automatic structures

DOI10.1007/978-3-030-81508-0_20OpenAlexW3188056966MaRDI QIDQ832943

Dietrich Kuske

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_20

zbMATH Keywords

automatic classesclasses of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Second-order finite automata ⋮ Properties of graphs specified by a regular language

Cites Work

• Unnamed Item
• Synchronized rational relations of finite and infinite words
• On the valuedness of finite transducers
• On direct products of automaton decidable theories
• Learnability of automatic classes
• The isomorphism problem on classes of automatic structures with transitive relations
• Where Automatic Structures Benefit from Weighted Automata
• Is Ramsey's theorem omega-automatic?
• Automata Presenting Structures: A Survey of the Finite String Case
• MSO on the Infinite Binary Tree: Choice and Order
• Second-Order Finite Automata
• Foundations of Software Science and Computation Structures
• Automatic presentations of structures

This page was built for publication: Second-order finite automata: expressive power and simple proofs using automatic structures