### Abstract

Original language | English |
---|---|

Title of host publication | International Workshop on Descriptional Complexity of Formal Systems |

Place of Publication | Cham |

Pages | 243-255 |

Number of pages | 13 |

Volume | 9118 |

DOIs | |

Publication status | Published - 16 Jun 2015 |

Event | International Workshop on Descriptional Complexity of Formal Systems - University of Waterloo, Ontario, Canada. DCFS 2015 Duration: 16 Jun 2015 → … |

### Publication series

Name | Lecture Notes in Computer Science |
---|

### Workshop

Workshop | International Workshop on Descriptional Complexity of Formal Systems |
---|---|

Period | 16/06/15 → … |

### Fingerprint

### Bibliographical note

The final authenticated version is available online at https://doi.org/10.1007/978-3-319-19225-3_21### Cite this

*International Workshop on Descriptional Complexity of Formal Systems*(Vol. 9118, pp. 243-255). (Lecture Notes in Computer Science). Cham. https://doi.org/10.1007/978-3-319-19225-3_21

}

*International Workshop on Descriptional Complexity of Formal Systems.*vol. 9118, Lecture Notes in Computer Science, Cham, pp. 243-255, International Workshop on Descriptional Complexity of Formal Systems, 16/06/15. https://doi.org/10.1007/978-3-319-19225-3_21

**Groups whose word problem is a Petri net language.** / Rino Nesin, Gabriela; Thomas, Richard M.

Research output: Chapter in Book/Conference proceeding with ISSN or ISBN › Conference contribution with ISSN or ISBN › Research › peer-review

TY - GEN

T1 - Groups whose word problem is a Petri net language

AU - Rino Nesin, Gabriela

AU - Thomas, Richard M.

N1 - The final authenticated version is available online at https://doi.org/10.1007/978-3-319-19225-3_21

PY - 2015/6/16

Y1 - 2015/6/16

N2 - There has been considerable interest in exploring the connections between the word problem of a finitely generated group as a formal language and the algebraic structure of the group. However, there are few complete characterizations that tell us precisely which groups have their word problem in a specified class of languages. We investigate which finitely generated groups have their word problem equal to a language accepted by a Petri net and give a complete classification, showing that a group has such a word problem if and only if it is virtually abelian.

AB - There has been considerable interest in exploring the connections between the word problem of a finitely generated group as a formal language and the algebraic structure of the group. However, there are few complete characterizations that tell us precisely which groups have their word problem in a specified class of languages. We investigate which finitely generated groups have their word problem equal to a language accepted by a Petri net and give a complete classification, showing that a group has such a word problem if and only if it is virtually abelian.

U2 - 10.1007/978-3-319-19225-3_21

DO - 10.1007/978-3-319-19225-3_21

M3 - Conference contribution with ISSN or ISBN

VL - 9118

T3 - Lecture Notes in Computer Science

SP - 243

EP - 255

BT - International Workshop on Descriptional Complexity of Formal Systems

CY - Cham

ER -