Cover Image

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bozga, Marius, Iosif, Radu, Zuleger, Florian
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Tree-Verifiable Graph Grammars
by: Chimes, Mark, et al.
Published: (2024)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
by: Bueri, Lucas, et al.
Published: (2024)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
by: Iosif, Radu, et al.
Published: (2025)

Regular Expressions with Backreferences and Lookaheads Capture NLOG
by: Uezato, Yuya
Published: (2024)

Visibly Recursive Automata
by: Dubrulle, Kévin, et al.
Published: (2026)

Entropy of pebble automata and space complexity
by: Montoya, J. Andres
Published: (2026)

Complexity of Fungal Automaton Prediction
by: Formenti, Enrico, et al.
Published: (2026)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
by: Goles, Eric, et al.
Published: (2026)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
by: Moreira, Nelma, et al.
Published: (2025)

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

On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
by: Podolskii, Vladimir, et al.
Published: (2024)

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

Trading Determinism for Noncommutativity in Edmonds' Problem
by: Arvind, V., et al.
Published: (2024)

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
by: Gezer, M. Utkan, et al.
Published: (2020)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
by: Yamakami, Tomoyuki
Published: (2022)

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

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

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

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
by: Yamakami, Tomoyuki
Published: (2021)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
by: Manea, Florin, et al.
Published: (2024)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
by: Vinarskii, Evgenii, et al.
Published: (2025)

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

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
by: Yamakami, Tomoyuki
Published: (2024)

Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
by: Chen, Zeyu, et al.
Published: (2025)

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
by: Acampora, Renato, et al.
Published: (2024)

Membership and Conjugacy in Inverse Semigroups
by: Fleischer, Lukas, et al.
Published: (2025)

Greybox Learning of Languages Recognizable by Event-Recording Automata
by: Majumdar, Anirban, et al.
Published: (2024)

Hardness of Regular Expression Matching with Extensions
by: Nogami, Taisei, et al.
Published: (2026)

Matching walks that are minimal with respect to edge inclusion
by: Marsault, Victor
Published: (2024)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

Time complexity for deterministic string machines
by: Cataltepe, Ali, et al.
Published: (2024)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
by: Yamakami, Tomoyuki
Published: (2024)

Finding Diverse Strings and Longest Common Subsequences in a Graph
by: Shida, Yuto, et al.
Published: (2024)