Parallel complexity of partially commutative monoids
We consider the parallel complexity of some problems issued from Petri nets, partially commutative monoids and finite automata. we prove the following: (19 The membership problem for firing sequances on Petri Nets can be solved in constant time by circuits of unbounded fan-in with gates
| Autores: | ; |
|---|---|
| Tipo de documento: | Relatório |
| Data de publicação: | 1989 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | Inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/110569 |
| Acesso em linha: | https://hdl.handle.net/2117/110569 |
| Nível de acesso: | Acesso aberto |
| Palavra-chave: | Computational complexity Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
| Resumo: | We consider the parallel complexity of some problems issued from Petri nets, partially commutative monoids and finite automata. we prove the following: (19 The membership problem for firing sequances on Petri Nets can be solved in constant time by circuits of unbounded fan-in with gates |
|---|