Cover Image

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Grabmayer, Clemens
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science Formal Languages and Automata Theory F.4.1; F1.1; I.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Equivariant ideals of polynomials
by: Ghosh, Arka, et al.
Published: (2024)

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

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

AI-Oracle Machines for Intelligent Computing
by: Wang, Jie
Published: (2024)

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

Inquisitive Team Semantics of LTL
by: Bozzelli, Laura, et al.
Published: (2025)

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
by: Arellanes, Damian
Published: (2021)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

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

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

Constructing Weakly Terminating Interface Protocols
by: Bera, Debjyoti, et al.
Published: (2026)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)

Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
by: Myreen, Magnus O., et al.
Published: (2025)

A LOCAL View of the Polynomial Hierarchy
by: Reiter, Fabian
Published: (2023)

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

On some Classes of Reversible 2-head Automata
by: Nagy, Benedek, et al.
Published: (2025)

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

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

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

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)

Parameterized Verification of Disjunctive Timed Networks
by: André, Étienne, et al.
Published: (2023)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

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

On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)