Difference between revisions of "Publications/fahrenberg.23.pn"
From LRDE
(Created page with "{{Publication | published = true | date = 2023-03-05 | authors = Uli Fahrenberg, Krzysztof Ziemiański | title = A Myhill-Nerode Theorem for Higher-Dimensional Automata | seri...") |
|||
| Line 33: | Line 33: | ||
deterministic HDA. Using our theorem, we develop an |
deterministic HDA. Using our theorem, we develop an |
||
internal characterisation of deterministic languages.<nowiki>}</nowiki>, |
internal characterisation of deterministic languages.<nowiki>}</nowiki>, |
||
| + | month = mar, |
||
note = <nowiki>{</nowiki>Accepted<nowiki>}</nowiki> |
note = <nowiki>{</nowiki>Accepted<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Revision as of 16:45, 5 March 2023
- Authors
- Uli Fahrenberg, Krzysztof Ziemiański
- Where
- Application and Theory of Petri Nets and Concurrency (PETRI NETS)
- Type
- inproceedings
- Publisher
- Springer
- Projects
- AA"AA" is not in the list (Vaucanson, Spot, URBI, Olena, APMC, Tiger, Climb, Speaker ID, Transformers, Bison, ...) of allowed values for the "Related project" property.
- Date
- 2023-03-05
Abstract
We establish a Myhill-Nerode type theorem for higher-dimensional automata (HDAs), stating that a language is regular precisely if it has finite prefix quotient. HDAs extend standard automata with additional structure, making it possible to distinguish between interleavings and concurrency. We also introduce deterministic HDAs and show that not all HDAs are determinizable, that is, there exist regular languages that cannot be recognised by a deterministic HDA. Using our theorem, we develop an internal characterisation of deterministic languages.
Bibtex (lrde.bib)
@InProceedings{ fahrenberg.23.pn,
author = {Fahrenberg, Uli and Ziemia{\'n}ski, Krzysztof},
title = {A {Myhill}-{Nerode} Theorem for Higher-Dimensional
Automata},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
booktitle = {Application and Theory of Petri Nets and Concurrency
(PETRI NETS)},
year = {2023},
abstract = {We establish a Myhill-Nerode type theorem for
higher-dimensional automata (HDAs), stating that a language
is regular precisely if it has finite prefix quotient. HDAs
extend standard automata with additional structure, making
it possible to distinguish between interleavings and
concurrency. We also introduce deterministic HDAs and show
that not all HDAs are determinizable, that is, there exist
regular languages that cannot be recognised by a
deterministic HDA. Using our theorem, we develop an
internal characterisation of deterministic languages.},
month = mar,
note = {Accepted}
}