Cover Image

Navigational hierarchies of regular languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Place, Thomas, Zeitoun, Marc
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dot-depth three, return of the J-class
by: Place, Thomas, et al.
Published: (2024)

All about unambiguous polynomial closure
by: Place, Thomas, et al.
Published: (2022)

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

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

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

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

A short survey around the pumping lemma for context-free languages
by: Gullà, Gabriele
Published: (2024)

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

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
by: Fülöp, Zoltán, et al.
Published: (2025)

Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)

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

Deciding Subtyping for Asynchronous Multiparty Sessions
by: Li, Elaine, et al.
Published: (2024)

Recursive numeral systems are highly regular and easy to process
by: Prasertsom, Ponrawee, et al.
Published: (2025)

Cost Automata, Safe Schemes, and Downward Closures
by: Barozzini, David, et al.
Published: (2020)

Do CFLOBDDs Actually Make Use of Linear Structure?
by: Sistla, Meghana Aparna, et al.
Published: (2026)

QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)

Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

Time for Timed Monitorability
by: Grosen, Thomas M., et al.
Published: (2025)

Geodesic languages for rational subsets and conjugates in virtually free groups
by: Carvalho, André, et al.
Published: (2024)

Information-flow Interfaces and Security Lattices
by: Bartocci, Ezio, et al.
Published: (2024)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)

Regular language quantum states
by: Florido-Llinàs, Marta, et al.
Published: (2024)

Sequential densities of rational languages
by: Gorman, Alexi Block, et al.
Published: (2026)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

A cartesian closed fibration of higher-order regular languages
by: Melliès, Paul-André, et al.
Published: (2026)

Twinning automata and regular expressions for string static analysis
by: Negrini, Luca, et al.
Published: (2020)

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

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)

A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)

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

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)