:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wei, Zhenghao, Lin, Kehua, Feng, Jianlin
Format:	Preprint
Published:	2024
Subjects:	Computation and Language Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2404.17343
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Reachability in Trace-Pushdown Systems
by: Köcher, Chris, et al.
Published: (2025)

Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

Complexity of Fungal Automaton Prediction
by: Formenti, Enrico, et al.
Published: (2026)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
by: Yamakami, Tomoyuki
Published: (2021)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
by: Yamakami, Tomoyuki
Published: (2024)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
by: Haneef, Farah
Published: (2024)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
by: Göller, Stefan, et al.
Published: (2023)

LOGOS-CA: A Cellular Automaton Using Natural Language as State and Rule
by: Utimula, Keishu
Published: (2026)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Finite-State Automaton To/From Regular Expression Visualization
by: Morazán, Marco T., et al.
Published: (2024)

Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses
by: Lussi, Eduardo Willwock, et al.
Published: (2024)

Visual Execution and Validation of Finite-State Machines and Pushdown Automata
by: Morazán, Marco T., et al.
Published: (2025)

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
by: Czerwiński, Wojciech, et al.
Published: (2025)

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
by: Drewes, Frank, et al.
Published: (2025)

A Finite-State Symbolic Automaton Model for the Collatz Map and Its Convergence Properties
by: Brauer, Leonard Ben Aurel
Published: (2025)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
by: Vieira, Tim
Published: (2026)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

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

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

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

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

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

NILE: Formalizing Natural-Language Descriptions of Formal Languages
by: Kneisel, Tristan, et al.
Published: (2026)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)

Parametrizing Reads-From Equivalence for Predictive Monitoring
by: Farzan, Azadeh, et al.
Published: (2026)

A Synthesis Method of Safe Rust Code Based on Pushdown Colored Petri Nets
by: Zhang, Kaiwen, et al.
Published: (2026)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
by: Takata, Yoshiaki, et al.
Published: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)

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

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