KudoZ home » Italian to English » Tech/Engineering

automa a stati

English translation: state automaton

Advertisement

Login or register (free and only takes a few minutes) to participate in this question.

You will also have access to many other tools and opportunities designed for those who have language-related jobs
(or are passionate about them). Participation is free and the site has a strict confidentiality policy.
GLOSSARY ENTRY (DERIVED FROM QUESTION BELOW)
Italian term or phrase:automa a stati
English translation:state automaton
Options:
- Contribute to this entry
- Include in personal glossary

14:32 Jul 2, 2002
Italian to English translations [PRO]
Tech/Engineering
Italian term or phrase: automa a stati
text on production management, data collection....
XXX Design è lo strumento che consente di disegnare il layout di insieme delle differenti componenti della rete aziendale di raccolta dati di produzione, magazzino, vendite, nonchè di progettare la logica di rilevazione e la sequenza di tutte le informazioni che saranno gestite dalla rete dei terminali.
XXXX Design agevola la generazione dell'automa a stati, ovvero dell'insieme delle operazioni svolte da ogni terminale per la raccolta dati.
Possono essere create più macchine a stati per gestire diversi compiti di raccolta dati in un unico progetto.
Cate
Italy
Local time: 18:17
sing. state automaton / pl. state automata
Explanation:
See the second link especially, it could be very helpful for other terms as well.

Ogni automa a stati finiti è associato univocamente ad un grafo orientato (in inglese direct graph) chiamato diagramma di transizione (in inglese transition diagram).
I nodi del grafo coincidono con gli stati dell’automa. Se esiste una transizione dallo stato q allo stato p con a come simbolo associato, allora esiste un arco orientato dal nodo q al nodo p ed etichettato con il simbolo a.
Per questa ragione gli automi a stati finiti vengono anche detti reti di transizione a stati finiti (FSTN, finite state transition network, in inglese).

Reducing the Automaton If there is one accepting state, and it is not the start state, eliminate all other states.

ffl The result is a 2-state automaton with RE's

on 4 arcs. Fig. 10.43, p. 586,FCS, gives the automaton and the resulting RE.

Some additional details: ffl If start = accepting, you get a 1-state automaton as in Fig. 10.44.

ffl If there is more than 1 accepting state, repeat

process for each and take the union of the resulting RE's.



--------------------------------------------------
Note added at 2002-07-02 22:14:36 (GMT)
--------------------------------------------------

Plural for \"automaton\" can be either \"automata\" or \"automatons\" , but there seems to be a preference for automata
Selected response from:

Daniela McKeeby
United States
Local time: 12:17
Grading comment
Thanks a lot for your help!!!
4 KudoZ points were awarded for this answer

Advertisement


Summary of answers provided
4 +3sing. state automaton / pl. state automata
Daniela McKeeby


  

Answers


7 hrs   confidence: Answerer confidence 4/5Answerer confidence 4/5 peer agreement (net): +3
sing. state automaton / pl. state automata


Explanation:
See the second link especially, it could be very helpful for other terms as well.

Ogni automa a stati finiti è associato univocamente ad un grafo orientato (in inglese direct graph) chiamato diagramma di transizione (in inglese transition diagram).
I nodi del grafo coincidono con gli stati dell’automa. Se esiste una transizione dallo stato q allo stato p con a come simbolo associato, allora esiste un arco orientato dal nodo q al nodo p ed etichettato con il simbolo a.
Per questa ragione gli automi a stati finiti vengono anche detti reti di transizione a stati finiti (FSTN, finite state transition network, in inglese).

Reducing the Automaton If there is one accepting state, and it is not the start state, eliminate all other states.

ffl The result is a 2-state automaton with RE's

on 4 arcs. Fig. 10.43, p. 586,FCS, gives the automaton and the resulting RE.

Some additional details: ffl If start = accepting, you get a 1-state automaton as in Fig. 10.44.

ffl If there is more than 1 accepting state, repeat

process for each and take the union of the resulting RE's.



--------------------------------------------------
Note added at 2002-07-02 22:14:36 (GMT)
--------------------------------------------------

Plural for \"automaton\" can be either \"automata\" or \"automatons\" , but there seems to be a preference for automata


    Reference: http://www-formal.stanford.edu/jmc/freewill/node7.html
    Reference: http://project.cgm.unive.it/didattica/bordeaux/automi/fstn.h...
Daniela McKeeby
United States
Local time: 12:17
Native speaker of: Native in EnglishEnglish, Native in RomanianRomanian
PRO pts in pair: 176
Grading comment
Thanks a lot for your help!!!

Peer comments on this answer (and responses from the answerer)
agree  Laura Bordignon
11 hrs

agree  gmel117608
13 hrs

agree  alitalia: finite state automata (FSA), this is a good site too: www.cs.princeton.edu/~lworthin/126/precepts/fsa.html
22 hrs
  -> thank you for the link
Login to enter a peer comment (or grade)




Return to KudoZ list


KudoZ™ translation help
The KudoZ network provides a framework for translators and others to assist each other with translations or explanations of terms and short phrases.



See also:



Term search
  • All of ProZ.com
  • Term search
  • Jobs
  • Forums
  • Multiple search