Groups Whose Word Problem is a Petri Net Language

DOI10.1007/978-3-319-19225-3_21zbMath1432.20023OpenAlexW2400913730MaRDI QIDQ5500697

Gabriela Aslı Rino Nesin, Richard M. Thomas

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://research.brighton.ac.uk/en/publications/f897a9cc-1a06-42ef-b89e-6700cab281c6

zbMATH Keywords

word problemfinitely generated groupPetri net language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

Groups whose word problems are accepted by abelian \(G\)-automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Groups and NTS languages
• Groups, the theory of ends, and context-free languages
• The accessibility of finitely presented groups
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• A structure to decide reachability in Petri nets
• Group presentations, formal languages and characterizations of one- counter groups
• Computation sequence sets
• Remarks on blind and partially blind one-way multicounter machines
• ON GROUPS AND COUNTER AUTOMATA
• On a subclass of context-free groups
• The co-word problem for the Higman-Thompson group is context-free
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
• On Context-Free Languages

This page was built for publication: Groups Whose Word Problem is a Petri Net Language