Imagen de Portada

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wei, Zhenghao, Lin, Kehua, Feng, Jianlin
Formato:	Preprint
Publicado:	2024
Materias:	Computation and Language Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Explorability in Pushdown Automata
por: Bedi, Ayaan, et al.
Publicado: (2025)

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

Visibly Pushdown Languages in Groups
por: Ciobanu, Laura, et al.
Publicado: (2026)

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

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

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

Complexity of Fungal Automaton Prediction
por: Formenti, Enrico, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A Tree Sampler for Bounded Context-Free Languages
por: Considine, Breandan
Publicado: (2024)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
por: Becker, Ruben, et al.
Publicado: (2024)

A General Information Extraction Framework Based on Formal Languages
por: Schmid, Markus L.
Publicado: (2025)