Properties of graphs specified by a regular language

DOI10.1007/s00236-022-00427-zOpenAlexW3157302022WikidataQ124985191 ScholiaQ124985191MaRDI QIDQ5918788

Petra Wolf, Volker Diekert, Henning Fernau

Publication date: 30 August 2022

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-022-00427-z

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• TreeRePair

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular realizability problems for context-free languages
• Groups, the theory of ends, and context-free languages
• Graph minors. III. Planar tree-width
• The structure of the models of decidable monadic theories of graphs
• Second-order finite automata: expressive power and simple proofs using automatic structures
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Detecting palindromes, patterns and borders in regular languages
• S-functions for graphs
• Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy
• The word problem for the Burnside varieties
• Automata equipped with auxiliary data structures and regular realizability problems
• Semigroups, Presburger formulas, and languages
• Nonserial dynamic programming
• Structural properties of word representable graphs
• Graph Theory
• Second-Order Finite Automata
• On finite monoids having only trivial subgroups
• On Context-Free Languages
• Properties of graphs specified by a regular language
• On the decidability of finding a positive ILP-instance in a regular set of ILP-instances

This page was built for publication: Properties of graphs specified by a regular language