On the width of regular classes of finite structures

DOI10.1007/978-3-030-29436-6_2OpenAlexW2969906584MaRDI QIDQ2305404

Mateus de Oliveira Oliveira, Alexsander Andrade de Melo

Publication date: 10 March 2020

Full work available at URL: https://arxiv.org/abs/2104.10286

zbMATH Keywords

automatic structuresfirst order logicwidth measures

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Second-order finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• On symbolic OBDD-based algorithms for the minimum spanning tree problem
• The structure of the models of decidable monadic theories of graphs
• The treewidth and pathwidth of hypercubes
• Trees, grids, and MSO decidability: from graphs to matroids
• Graph classes with and without powers of bounded clique-width
• Automatic groups: A guided tour
• Linear time solvable optimization problems on graphs of bounded clique-width
• Symbolic topological sorting with OBDDs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• On the Width of Ordered Binary Decision Diagrams
• Three Lectures on Automatic Structures
• Weak Second‐Order Arithmetic and Finite Automata
• Algorithmic Meta-theorems
• Decision Problems of Finite Automata Design and Related Arithmetics
• Graphs of relational structures
• 10.1162/jmlr.2003.3.4-5.679
• Algorithmic Meta Theorems for Sparse Graph Classes
• Mathematical Logic
• Advice Automatic Structures and Uniformly Automatic Classes
• SOFSEM 2004: Theory and Practice of Computer Science
• Automatic presentations of structures

This page was built for publication: On the width of regular classes of finite structures