Second-order finite automata: expressive power and simple proofs using automatic structures
From MaRDI portal
Publication:832943
DOI10.1007/978-3-030-81508-0_20OpenAlexW3188056966MaRDI QIDQ832943FDOQ832943
Authors: Dietrich Kuske 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_20
Recommendations
- Second-order finite automata
- Second-Order Finite Automata
- Finite automata over structures (extended abstract)
- Finite automata. II
- Realization of finite-automaton algorithms by structured programs. II
- Automata for the verification of monadic second-order graph properties
- Deciding monadic second order logic over \(\omega \)-words by specialized finite automata
- Weighted automata and monadic second order logic
- Two-way finite automata: old and recent results
Cites Work
- On the valuedness of finite transducers
- On direct products of automaton decidable theories
- The isomorphism problem on classes of automatic structures with transitive relations
- Automata Presenting Structures: A Survey of the Finite String Case
- MSO on the Infinite Binary Tree: Choice and Order
- Learnability of automatic classes
- Synchronized rational relations of finite and infinite words
- Cardinality and counting quantifiers on omega-automatic structures
- Where automatic structures benefit from weighted automata
- Is Ramsey's theorem omega-automatic?
- Second-Order Finite Automata
- Foundations of Software Science and Computation Structures
- Automatic presentations of structures
Cited In (2)
This page was built for publication: Second-order finite automata: expressive power and simple proofs using automatic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832943)
