Properties of graphs specified by a regular language

DOI10.1007/978-3-030-81508-0_10OpenAlexW3197605265MaRDI QIDQ5896894

Volker Diekert, Henning Fernau, Petra Wolf

Publication date: 25 March 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.00436

zbMATH Keywords

periodic semigroupsgraph propertiesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Properties of graphs specified by a regular language ⋮ On the decidability of finding a positive ILP-instance in a regular set of ILP-instances ⋮ From decidability to undecidability by considering regular sets of instances

Uses Software

• TreeRePair

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular realizability problems for context-free languages
• The structure of the models of decidable monadic theories of graphs
• Detecting palindromes, patterns and borders in regular languages
• Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy
• The word problem for the Burnside varieties
• On finite monoids having only trivial subgroups
• 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