Forkable Regular Expressions

DOI10.1007/978-3-319-30000-9_15zbMath1443.68097arXiv1510.07293OpenAlexW2238703166MaRDI QIDQ2798720

Peter Thiemann, Martin Sulzmann

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

automataderivativesforkable expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go, Derivatives for Enhanced Regular Expressions