Results 341 to 350 of about 4,638,570 (374)

Regular Languages

1983
Publisher Summary Computability theory is the theory of computation obtained when limitations of space and time are deliberately ignored. In automata theory, computation is studied in a context in which bounds on space and time are entirely relevant. The point of view of computability theory is exemplified in the behaviour of a Turing machine in which
Elaine J. Weyuker, Martin Davis
openaire   +2 more sources

Regularity of a dynamic neighborhood of a regular language

Proceedings of the Steklov Institute of Mathematics, 2009
The operation of taking a dynamic neighborhood of a language is studied. It is proved that this operation preserves the regularity of the language. The increase in the complexity of the language under the passage to its dynamic neighborhood is estimated.
openaire   +2 more sources

Commutative Regular Languages - Properties and State Complexity

Conference on Algebraic Informatics, 2019
Stefan Hoffmann
semanticscholar   +1 more source

Inferring regular languages and ω-languages

J. Log. Algebraic Methods Program., 2018
D. Fisman
semanticscholar   +1 more source

Separating Regular Languages with Two Quantifiers Alternations

2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Thomas Place
semanticscholar   +1 more source

Deciding Determinism of Regular Languages

Theory of Computing Systems, 2014
Ping Lu, Joachim Bremer, H. Chen
semanticscholar   +1 more source

Parameterized Prefix Distance between Regular Languages

Conference on Current Trends in Theory and Practice of Informatics, 2014
Martin Kutrib, Katja Meckel, Matthias Wendlandt   +2 more
semanticscholar   +1 more source

Interruption of regular dental visits during the COVID‐19 pandemic due to concerns regarding dental visits was associated with periodontitis in Japanese office workers

Journal of Periodontal Research, 2021
Keisuke Nakashima, Masanori Iwasaki, Michihiko Usui   +2 more
exaly  

High-Efficiency Electromagnetic Interference Shielding of rGO@FeNi/Epoxy Composites with Regular Honeycomb Structures

Nano-Micro Letters, 2022
Junwei Gu
exaly  

Characterising REGEX languages by regular languages equipped with factor-referencing

Information and Computation, 2014
Markus L. Schmid
semanticscholar   +1 more source