:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Shanker, Devan
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Machine Learning Robotics I.2.9; I.6.4; C.4; F.4; H.3.3
Online Access:	https://arxiv.org/abs/2406.17627
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Digging for Decision Trees: A Case Study in Strategy Sampling and Learning
by: Budde, Carlos E., et al.
Published: (2024)

Real-Time Model Checking for Closed-Loop Robot Reactive Planning
by: Chandler, Christopher, et al.
Published: (2025)

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
by: Varatalu, Ian Erik, et al.
Published: (2024)

DFAMiner: Mining minimal separating DFAs from labelled samples
by: Dell'Erba, Daniele, et al.
Published: (2024)

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

Beyond Winning Strategies: Admissible and Admissible Winning Strategies for Quantitative Reachability Games
by: Muvvala, Karan, et al.
Published: (2024)

Chance-Constrained MPPI under State and Dynamic Object Prediction Uncertainty and the Evaluation of Collision Risk Calibration
by: Serfling, Benjamin, et al.
Published: (2026)

Reward Machines for Deep RL in Noisy and Uncertain Environments
by: Li, Andrew C., et al.
Published: (2024)

Unsupervised Automata Learning via Discrete Optimization
by: Lutz, Simon, et al.
Published: (2023)

The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
by: Luo, Wei
Published: (2026)

Asymptotic Hausdorff and Language Similarity
by: Fisman, Dana, et al.
Published: (2026)

Preprint: Exploring Inevitable Waypoints for Unsolvability Explanation in Hybrid Planning Problems
by: Sarwar, Mir Md Sajid, et al.
Published: (2025)

Exploring Large Language Models for Access Control Policy Synthesis and Summarization
by: Vatsa, Adarsh, et al.
Published: (2025)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
by: Alevizos, Elias, et al.
Published: (2024)

Good-for-MDP State Reduction for Stochastic LTL Planning
by: Weinhuber, Christoph, et al.
Published: (2025)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
by: Schmid, Markus L.
Published: (2019)

A Layered Implementation Framework for Regular Languages
by: Charlier, Baudouin Le
Published: (2025)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
by: Hebballi, Chirantan, et al.
Published: (2026)

CC-SGG: Corner Case Scenario Generation using Learned Scene Graphs
by: Drayson, George, et al.
Published: (2023)

Orchestration of Music by Grammar Systems
by: Makiš, Jozef, et al.
Published: (2025)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
by: Schalk, Patrizia, et al.
Published: (2024)

Example-Free Learning of Regular Languages with Prefix Queries
by: Fernando, Eve, et al.
Published: (2025)

Parsing Hypergraphs using Context-Free Positional Grammars
by: Costagliola, Gennaro, et al.
Published: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)

Algebraic Language Theory with Effects
by: Lenke, Fabian, et al.
Published: (2024)

Commuting upper triangular binary morphisms
by: Honkala, Juha
Published: (2023)

Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
by: Löding, Christof, et al.
Published: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)

Verifying Unboundedness via Amalgamation
by: Anand, Ashwani, et al.
Published: (2024)

Omega-Regular Robustness
by: Fisman, Dana, et al.
Published: (2025)

Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)