Results 261 to 270 of about 29,290 (288)

Incremental DFA Minimisation.

2010
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance.
Marco Almeida, Nelma Moreira, Rogério Reis   +2 more
openaire   +1 more source

Het DFA huis

De Constructeur, 1993
De assemblage is veelal een zwakke schakel in het voortbrengingsproces. Het is een bedrijfsactiviteit die verantwoordelijk is voor onder meer een belangrijk deel van de totale doorlooptijd. Robot assemblagesystemen bieden goede mogelijkheden om de assemblage-activiteiten te rationaliseren, mede vanwege de toenemende produkt diversiteit, de afnemende ...
openaire   +1 more source

Families of DFAs as Acceptors of omega-Regular Languages

International Symposium on Mathematical Foundations of Computer Science, 2016
D. Angluin, Udi Boker, D. Fisman
semanticscholar   +1 more source

Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers

Automated Technology for Verification and Analysis, 2012
D. Neider
semanticscholar   +1 more source

Novelty Analysis of the DFAS-Signal Methodology: Ethical–Temporal Intelligence and the DFAS Analysis Map (DFAS-AM)

This publication presents the conceptual and methodological innovation of the DFAS-Signal Methodology, developed under the Dynamic Financial Applied Meta-Science (DFAS) doctrine by Hasan Alaali. The study introduces a new analytical paradigm — Ethical–Temporal Intelligence — that interprets global financial, political, and behavioral events as dynamic ...
openaire   +1 more source

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs

International Conference on Implementation and Application of Automata, 2012
Galina Jirásková, Tomas Masopust
semanticscholar   +1 more source

Differential Encoding of DFAs for Fast Regular Expression Matching

IEEE/ACM Transactions on Networking, 2011
D. Ficara, A. D. Pietro, S. Giordano, G. Procissi, F. Vitucci, G. Antichi   +5 more
semanticscholar   +1 more source

DFAS-EIR-AI-02A: Verified Recognition of the DFAS Conference–Journal Governance Protocol (DFAS-CGP) by Perplexity AI

This record documents the second verified case of algorithmic recognition under Annex X — DFAS-EIR-AI (Artificial Intelligence Integrity and Recognition Classification System), developed as an extension of the DFAS-EEP (Editorial Ethics Protocol) within the Dynamic Financial Applied Meta-Science (DFAS) doctrine.
openaire   +1 more source

Inductive Inference, DFAs, and Computational Complexity

Analogical and Inductive Inference, 1989
L. Pitt
semanticscholar   +1 more source

Parallel XML Parsing Using Meta-DFAs

IEEE International Conference on e-Science, 2007
Yinfei Pan, Y. Zhang, K. Chiu, Wei Lu
semanticscholar   +1 more source