Cover Image

Recursive numeral systems are highly regular and easy to process

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Prasertsom, Ponrawee, Silvi, Andrea, Culbertson, Jennifer, Johansson, Moa, Dubhashi, Devdatt, Smith, Kenny
Format:	Preprint
Published:	2025
Subjects:	Computation and Language Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Evaluating the relationship between regularity and learnability in recursive numeral systems using Reinforcement Learning
by: Silvi, Andrea, et al.
Published: (2026)

Visibly Recursive Automata
by: Dubrulle, Kévin, et al.
Published: (2026)

Specify What? Enhancing Neural Specification Synthesis by Symbolic Methods
by: Granberry, George, et al.
Published: (2024)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Navigational hierarchies of regular languages
by: Place, Thomas, et al.
Published: (2024)

Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)

Note on dissecting power of regular languages
by: Rukavicka, Josef
Published: (2023)

The rotating normal form of braids is regular
by: Fromentin, Jean
Published: (2016)

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)

Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)

Recursive Prime Factorizations: Dyck Words as Numbers
by: Childress, Ralph L.
Published: (2021)

Model Checking Temporal Properties of Recursive Probabilistic Programs
by: Winkler, Tobias, et al.
Published: (2021)

Descriptional Complexity of Finite Automata -- Selected Highlights
by: Salomaa, Arto, et al.
Published: (2023)

The theory of reachability in trace-pushdown systems
by: Kuske, Dietrich
Published: (2025)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Autoformalization in the Wild: Assessing LLMs on Real-World Mathematical Definitions
by: Zhang, Lan, et al.
Published: (2025)

LangSAT: A Novel Framework Combining NLP and Reinforcement Learning for SAT Solving
by: Pan, Muyu, et al.
Published: (2025)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy
by: Yang, Andy, et al.
Published: (2025)

Explorability in Pushdown Automata
by: Bedi, Ayaan, et al.
Published: (2025)

Reachability in symmetric VASS
by: Kamiński, Łukasz, et al.
Published: (2025)

Tutorial: $φ$-Transductions in OpenFst via the Gallic Semiring
by: Cognetta, Marco, et al.
Published: (2025)

Cluster automata
by: Kornai, András
Published: (2025)

MASA: LLM-Driven Multi-Agent Systems for Autoformalization
by: Zhang, Lan, et al.
Published: (2025)

Benchmarking Testing in Automated Theorem Proving
by: Kim, Jongyoon, et al.
Published: (2026)

Consistent Autoformalization for Constructing Mathematical Libraries
by: Zhang, Lan, et al.
Published: (2024)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
by: Prabhu, Shreekanth M, et al.
Published: (2023)

Transducing Language Models
by: Snæbjarnarson, Vésteinn, et al.
Published: (2026)

Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
by: Lan, Nur, et al.
Published: (2024)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

Self-Replicating Mechanical Universal Turing Machine
by: Lano, Ralph P.
Published: (2024)

Automata-based constraints for language model decoding
by: Koo, Terry, et al.
Published: (2024)

On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning
by: Nowak, Franz, et al.
Published: (2024)

Prefix Parsing is Just Parsing
by: Pasti, Clemente, et al.
Published: (2026)

A* shortest string decoding for non-idempotent semirings
by: Gorman, Kyle, et al.
Published: (2022)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
by: Zahraei, Pardis Sadat, et al.
Published: (2024)

Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)

Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation
by: Manini, Andrea, et al.
Published: (2025)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)