non-deterministic rule application
[/nɑn dɪˌtɜrmɪˈnɪstɪk ruːl ˌæplɪˈkeɪʃən/]
nounpl: non-deterministic rule applications
aplicação não-determinística de regras
1. In computer science and formal language theory, a process where rules can be applied in multiple valid ways to the same input, with no single predetermined sequence or outcome guaranteed
The parser uses non-deterministic rule application to explore all possible parse trees simultaneously.
O analisador usa aplicação não-determinística de regras para explorar todas as árvores de análise possíveis simultaneamente.
2. A computational mechanism where the same rule set can produce different results depending on which rule is chosen at each step when multiple rules could apply
Non-deterministic rule application in the context-free grammar allows for multiple valid interpretations of the same sentence.
A aplicação não-determinística de regras na gramática livre de contexto permite múltiplas interpretações válidas da mesma frase.
3. The execution model used in non-deterministic finite automata and Turing machines where transitions are not uniquely determined by the current state and input
Using non-deterministic rule application, the NFA can accept strings through any valid path, not just a single predetermined one.
Usando aplicação não-determinística de regras, o AFN pode aceitar cadeias através de qualquer caminho válido, não apenas um único predeterminado.
This is a specialized technical term primarily used in computer science, linguistics, and formal language theory. It is equally recognized and used in both Brazilian Portuguese and European Portuguese academic and professional contexts. The term reflects the international nature of computer science terminology, where Portuguese-speaking developers and academics use the same conceptual framework as their English-speaking counterparts.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →