A computation model with automatic functions and relations as primitive operations
From MaRDI portal
Publication:2672645
DOI10.1016/j.tcs.2022.04.038OpenAlexW4221138676MaRDI QIDQ2672645
Ziyuan Gao, Ammar Fathin Sabili, Zeyong Li, Frank Stephan, Sanjay Jain
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.06836
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Universal recursively enumerable sets of strings
- Iterated sequential transducers as language generating devices
- The method of forced enumeration for nondeterministic automata
- On direct products of automaton decidable theories
- Turing machines with sublogarithmic space
- Deterministic automata. Simulation, universality and minimality
- The deluge of spurious correlations in big data
- Time bounded random access machines
- Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion
- Bi-immunity over different size alphabets
- Periodic generalized automata over the reals
- Searching for shortest and least programs
- Generalized finite automata over real and complex numbers
- Real time computation
- On One-way One-bit O (One)-message Cellular Automata
- Decision Problems for Finite Automata over Infinite Algebraic Structures
- Automatic functions, linear time and learning
- Finite Automata over Structures
- Automatic Functions, Linear Time and Learning
- Three Lectures on Automatic Structures
- Weak Second‐Order Arithmetic and Finite Automata
- Addition Machines
- Automata Presenting Structures: A Survey of the Finite String Case
- Universal Recursively Enumerable Sets of Strings
- Describing Groups
- Nondeterministic Space is Closed under Complementation
- Alternation
- Speed of Recognition of Context-Free Languages by Array Automata
- Iterated a-NGSM maps and Γ systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Deciding parity games in quasipolynomial time
- A Survey on Analog Models of Computation
- To Halt or Not to Halt? That Is the Question
- Automatic Structures
- Computational Complexity
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Recognition and parsing of context-free languages in time n3
- One-tape, off-line Turing machine computations
- Optimization of Straight Line Programs
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- On the complexity of \(k\)-SAT
This page was built for publication: A computation model with automatic functions and relations as primitive operations
