Groups whose word problem is a Petri net language

DOI10.1007/978-3-319-19225-3_21zbMATH Open1432.20023OpenAlexW2400913730MaRDI QIDQ5500697FDOQ5500697

Authors: Gabriela Asli 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

Recommendations

• Characterizing word problems of groups
• Word problems of groups: formal languages, characterizations and decidability
• On groups whose word problem is solved by a counter automaton.
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
• ON GROUPS AND COUNTER AUTOMATA

zbMATH Keywords

word problemfinitely generated groupPetri net language

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

This page was built for publication: Groups whose word problem is a Petri net language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500697)