Finite state machines for strings over infinite alphabets (Q5277703): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1013560.1013562 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056665285 / rank | |||
Normal rank | |||
Latest revision as of 01:05, 20 March 2024
scientific article; zbMATH DE number 6743947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite state machines for strings over infinite alphabets |
scientific article; zbMATH DE number 6743947 |
Statements
Finite state machines for strings over infinite alphabets (English)
0 references
12 July 2017
0 references
automata
0 references
XML
0 references
expressiveness
0 references
first-order logic
0 references
infinite alphabets
0 references
monadic second-order logic
0 references
pebbles
0 references
registers
0 references
