The theory of regular events. II
Havel, Ivan M. (1969)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Havel, Ivan M. (1969)
Kybernetika
Similarity:
Viliam Geffert, L'ubomíra Ištoňová (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider conversions of regular expressions into -realtime finite state automata, , automata in which the number of consecutive uses of -transitions, along any computation path, is bounded by a fixed constant . For -realtime automata, , for automata that cannot change the state, without reading an input symbol, more than two times in a row, we show that the conversion of a regular expression into such an automaton produces only states, log) -transitions, and alphabet-transitions....
Christian Hagenah, Anca Muscholl (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier (2008)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Computing the image of a regular language by the transitive closure of a relation is a central question in regular model checking. In a recent paper Bouajjani et al. [IEEE Comput. Soc. (2001) 399–408] proved that the class of regular languages – called APC – of the form , where the union is finite and each is either a single symbol or a language of the form with a subset of the alphabet, is...
Olivier Carton, Ramón Maceiras (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Marco Almeida, Nelma Moreira, Rogério Reis (2014)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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. We also include some experimental comparative results.
Solange Coupet-Grimal (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: