Pages that link to "Item:Q1764419"
From MaRDI portal
The following pages link to Finite presentations of infinite structures: Automata and interpretations (Q1764419):
Displaying 50 items.
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Reachability on prefix-recognizable graphs (Q975403) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Automatic presentations for semigroups. (Q1041033) (← links)
- The monoid of queue actions (Q1702520) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Automatic presentations and semigroup constructions (Q1959386) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- The isomorphism problem for FST injection structures (Q2151392) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- Model-theoretic properties of \(\omega\)-automatic structures (Q2254518) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- Groups of automatic automorphisms of some automatic structures (Q2371239) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Rewriting higher-order stack trees (Q2411043) (← links)
- Uncountable automatic classes and learning (Q2431428) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- Monitoring metric first-order temporal properties (Q2796403) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
- Reachability Games on Automatic Graphs (Q3073641) (← links)
- Rewriting Higher-Order Stack Trees (Q3194729) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Unary Automatic Graphs: An Algorithmic Perspective (Q3502677) (← links)
- Automata Presenting Structures: A Survey of the Finite String Case (Q3503740) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- Describing Groups (Q3533517) (← links)
- Some natural decision problems in automatic graphs (Q3570167) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- Uncountable Automatic Classes and Learning (Q3648759) (← links)
- On the geometry of Cayley automatic groups (Q5075699) (← links)
- Infinite Argumentation Frameworks (Q5172621) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- STACS 2004 (Q5309721) (← links)
- First-order and counting theories of<i>ω</i>-automatic structures (Q5387304) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- An Automata Theoretic Approach to Rational Tree Relations (Q5448669) (← links)
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
- STACS 2005 (Q5710719) (← links)
- Tree-Automatic Well-Founded Trees (Q5891703) (← links)
- Regular model checking revisited (Q6045028) (← links)
- Clique‐convergence is undecidable for automatic graphs (Q6055401) (← links)
- Addition machines, automatic functions and open problems of Floyd and Knuth (Q6098150) (← links)
- Efficient Evaluation of Arbitrary Relational Calculus Queries (Q6137874) (← links)
- Two Effective Properties of ω-Rational Functions (Q6169907) (← links)
- Ramsey quantifiers over automatic structures: complexity and applications to verification (Q6649458) (← links)
