Finite presentations of infinite structures: Automata and interpretations
From MaRDI portal
Recommendations
Cited in
(54)- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Automatic learning of subclasses of pattern languages
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- Lamplighter groups and automata
- Efficient Evaluation of Arbitrary Relational Calculus Queries
- An Automata Theoretic Approach to Rational Tree Relations
- Automatic Structures: Richness and Limitations
- STACS 2004
- Transforming structures by set interpretations
- A hierarchy of tree-automatic structures
- Reachability on prefix-recognizable graphs
- Groups of automatic automorphisms of some automatic structures
- The isomorphism relation between tree-automatic structures
- The monoid of queue actions
- First-order and counting theories ofω-automatic structures
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Uncountable automatic classes and learning
- Two Effective Properties of ω-Rational Functions
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Three lectures on automatic structures
- Don't care words with an application to the automata-based approach for real addition
- scientific article; zbMATH DE number 1747445 (Why is no real title available?)
- Uncountable automatic classes and learning
- Automata-based presentations of infinite structures
- Model-theoretic properties of \(\omega\)-automatic structures
- Monitoring metric first-order temporal properties
- Analysing Complexity in Classes of Unary Automatic Structures
- On the geometry of Cayley automatic groups
- The isomorphism problem for FST injection structures
- Regular model checking revisited
- The Reachability Problem over Infinite Graphs
- Isomorphisms of scattered automatic linear orders
- The isomorphism problem for tree-automatic ordinals with addition
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- STACS 2005
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
- Describing Groups
- Unary Automatic Graphs: An Algorithmic Perspective
- The isomorphism problem on classes of automatic structures with transitive relations
- Tree-automatic well-founded trees
- Automatic presentations for semigroups.
- String compression in FA-presentable structures
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- Automata Presenting Structures: A Survey of the Finite String Case
- Clique‐convergence is undecidable for automatic graphs
- Rewriting higher-order stack trees
- Learnability of automatic classes
- Addition machines, automatic functions and open problems of Floyd and Knuth
- Rewriting higher-order stack trees
- Automatic presentations and semigroup constructions
- Reachability games on automatic graphs
- Infinite argumentation frameworks. On the existence and uniqueness of extensions
- Some natural decision problems in automatic graphs
This page was built for publication: Finite presentations of infinite structures: Automata and interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764419)
