Checking NFA equivalence with bisimulations up to congruence (Q2931822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6374695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Checking NFA equivalence with bisimulations up to congruence |
scientific article; zbMATH DE number 6374695 |
Statements
Checking NFA equivalence with bisimulations up to congruence (English)
0 references
27 November 2014
0 references
antichain
0 references
automata
0 references
bisimulation
0 references
coinduction
0 references
congruence
0 references
language equivalence
0 references
up-to techniques
0 references
0.836900532245636
0 references
0.8158514499664307
0 references
0.7776172757148743
0 references
0.7714438438415527
0 references
0.7649602890014648
0 references
