Imagen de Portada

Declarative Integration and Management of Large Language Models through Finite Automata: Application to Automation, Communication, and Ethics

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Petit, Thierry, Pachot, Arnault, Conan-Vrinat, Claire, Dubarry, Alexandre
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory Artificial Intelligence Computation and Language Emerging Technologies Human-Computer Interaction 68T20 I.2.7; H.5.2; K.4.1; D.3.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

FSM Builder: A Tool for Writing Autograded Finite Automata Questions
por: Robson, Eliot Wong, et al.
Publicado: (2024)

A Theory of Hanoi Omega-Automata and Games
por: Filiot, Emmanuel, et al.
Publicado: (2026)

Tilt Automata: Gathering Particles With Uniform External Control
por: Fekete, Sándor P., et al.
Publicado: (2026)

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
por: Schaefer, Steven, et al.
Publicado: (2025)

Finite Automata Encoding Piecewise Polynomials
por: Berdinsky, Dmitry, et al.
Publicado: (2021)

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

Complexity of Unary Exclusive Nondeterministic Finite Automata
por: Kutrib, Martin, et al.
Publicado: (2024)

Gödel Number based Clustering Algorithm with Decimal First Degree Cellular Automata
por: Vikrant, Vicky, 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)

Active Automata Learning with Advice
por: Fica, Michał, et al.
Publicado: (2025)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
por: Yamakami, Tomoyuki
Publicado: (2023)

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

Learning Tree Automata with Term Rewriting
por: Kopystiański, Jakub, et al.
Publicado: (2026)

Parikh Automata on Finite and Infinite Words
por: Grobler, Mario, et al.
Publicado: (2023)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
por: Grabmayer, Clemens
Publicado: (2024)

Exact Synthetic Populations for Scalable Societal and Market Modeling
por: Petit, Thierry, et al.
Publicado: (2025)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Repetitive Finite Automata With Translucent Letters
por: Mráz, František, et al.
Publicado: (2024)

Automating the Analysis of Quantitative Automata with QuAK
por: Chalupa, Marek, et al.
Publicado: (2025)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2025)

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

Visibly Recursive Automata
por: Dubrulle, Kévin, et al.
Publicado: (2026)

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

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
por: Holík, Lukáš, et al.
Publicado: (2025)

Measure Many Quantum Finite Automata on Infinite Words
por: Midya, Abhisek, et al.
Publicado: (2026)

AI-Oracle Machines for Intelligent Computing
por: Wang, Jie
Publicado: (2024)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
por: Lacroce, Clara, et al.
Publicado: (2023)

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

Hypernode Automata
por: Bartocci, Ezio, et al.
Publicado: (2023)

Maximal Length Cellular Automata : A Survey
por: Adak, Sumit, et al.
Publicado: (2024)

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

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
por: Kostolányi, Peter, et al.
Publicado: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
por: Chocholatý, David, et al.
Publicado: (2023)

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

Difficulty Generating Factors for Context-free Language Construction Assignments
por: Schmalstieg, Florian, et al.
Publicado: (2025)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
por: Fernau, Henning, et al.
Publicado: (2024)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
por: Chen, Zeyu, et al.
Publicado: (2026)

Componentwise Automata Learning for System Integration (Extended Version)
por: Fujinami, Hiroya, et al.
Publicado: (2025)

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

Rerailing Automata
por: Ehlers, Rüdiger
Publicado: (2025)