On solving automaton equations

Verfasser / Beitragende:
[I. V. Lyalin]
Ort, Verlag, Jahr:
2004
Enthalten in:
Discrete Mathematics and Applications, 14/3(2004-07-01), 287-300
Format:
Artikel (online)
ID: 378896806
LEADER caa a22 4500
001 378896806
003 CHVBK
005 20180305123508.0
007 cr unu---uuuuu
008 161128e20040701xx s 000 0 eng
024 7 0 |a 10.1515/1569392031905610  |2 doi 
035 |a (NATIONALLICENCE)gruyter-10.1515/1569392031905610 
100 1 |a Lyalin  |D I. V. 
245 1 0 |a On solving automaton equations  |h [Elektronische Daten]  |c [I. V. Lyalin] 
520 3 |a We consider the problem of solving automata equations in one variable. We suggest an algorithm for determining whether a given equation has a solution. We introduce the notion of a boundedly non-determinate function. It is proved that if an automaton equation has a solution, then the set of all solutions of this equation is embedded into some boundedly non-determinate function which can be effectively constructed on the base of the initial equation. 
540 |a Copyright 2004, Walter de Gruyter 
773 0 |t Discrete Mathematics and Applications  |d Walter de Gruyter  |g 14/3(2004-07-01), 287-300  |x 0924-9265  |q 14:3<287  |1 2004  |2 14  |o dma 
856 4 0 |u https://doi.org/10.1515/1569392031905610  |q text/html  |z Onlinezugriff via DOI 
908 |D 1  |a research article  |2 jats 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1515/1569392031905610  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 100  |E 1-  |a Lyalin  |D I. V. 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Discrete Mathematics and Applications  |d Walter de Gruyter  |g 14/3(2004-07-01), 287-300  |x 0924-9265  |q 14:3<287  |1 2004  |2 14  |o dma 
900 7 |b CC0  |u http://creativecommons.org/publicdomain/zero/1.0  |2 nationallicence 
898 |a BK010053  |b XK010053  |c XK010000 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-gruyter