Undecidability of the equivalence of finite substitutions on regular language (Q4265533): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4265634 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equations over finite sets of words and equivalence problems in automata theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An undecidable problem for countable markov chains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4366889 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The undecidability of some equivalence problems concerning ngsm's and finite substitutions / rank | |||
Normal rank | |||
Latest revision as of 22:45, 28 May 2024
scientific article; zbMATH DE number 1339735
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability of the equivalence of finite substitutions on regular language |
scientific article; zbMATH DE number 1339735 |
Statements
Undecidability of the equivalence of finite substitutions on regular language (English)
0 references
22 September 1999
0 references
regular language
0 references
