Equivalence checking of prefix-free transducers and deterministic two-tape automata (Q2278270)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence checking of prefix-free transducers and deterministic two-tape automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence checking of prefix-free transducers and deterministic two-tape automata |
scientific article |
Statements
Equivalence checking of prefix-free transducers and deterministic two-tape automata (English)
0 references
4 December 2019
0 references
transducer
0 references
two-tape automaton
0 references
equivalence checking
0 references
prefix-free language
0 references
language equation
0 references
decision procedure
0 references
0.9057623
0 references
0.90447056
0 references
0.88071674
0 references
0.88050336
0 references
0.87913376
0 references
0.8765696
0 references
0.86791885
0 references
0.8653909
0 references
0.86520827
0 references
0.86405367
0 references
