Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895)
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: Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. |
scientific article; zbMATH DE number 5509585
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. |
scientific article; zbMATH DE number 5509585 |
Statements
Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (English)
0 references
19 February 2009
0 references
finite automata
0 references
first-order logic
0 references
synchronous relations
0 references
infinite alphabets
0 references
0 references
0.88572896
0 references
0 references
0.8766296
0 references
0.8693062
0 references
0 references
0.86844444
0 references
0.86778915
0 references
