Automatic presentations of structures
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5605134 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 806746 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- Computable Algebra, General Theory and Theory of Computable Fields
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Effective procedures in field theory
- Polynomial-time versus recursive models
- Problem of the number of non-self-equivalent constructivizations
- Synchronized rational relations of finite and infinite words
Cited in
(31)- Second-order finite automata: expressive power and simple proofs using automatic structures
- Universal quantification makes automatic structures hard to decide
- Defining algorithmically presented structures in first order logic
- Finite-valued streaming string transducers
- Computable classifications of continuous, transducer, and regular functions
- Complexity and categoricity of injection structures induced by finite state transducers
- A characterization of wreath products where knapsack is decidable
- Automatic structures and the problem of natural well-orderings
- Resynchronized uniformization and definability problems for rational relations
- Finite-valued streaming string transducers
- Symbolic automatic relations and their applications to SMT and CHC solving
- Quasi-isometric reductions between infinite strings
- The back-and-forth method and computability without delay
- Paths, ends and the separation problem for infinite graphs
- On the width of regular classes of finite structures
- The isomorphism problem for FST injection structures
- Universal quantification makes automatic structures hard to decide
- Punctual presentability in certain classes of algebraic structures
- Simple classes of automatic structures
- Tree-automatic well-founded trees
- Quasi-isometric reductions between infinite strings
- Computable fixpoints in well-structured symbolic model checking
- Realizable and context-free hyperlanguages
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- The theory of reachability of trace-pushdown systems
- The algebras for automatic relations
- Computational group theory. Abstracts from the workshop held June 1--6, 2025
- Semënov arithmetic, affine \{VASS\}, and string constraints
- Reachability in trace-pushdown systems
- On decidability of list structures
- Alternating automatic register machines
This page was built for publication: Automatic presentations of structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064290)
