Learn how configuration monitoring reveals system settings through behavior analysis.
Maximilian A. Köhl, Clemens Dubslaff, Holger Hermanns
― 7 min read
Computer Science - Formal Languages and Automata Theory
RSSLatest Articles
Formal Languages and Automata TheoryIntegrating Expert Knowledge in Process Discovery
Ali Norouzifar, Marcus Dees, Wil van der Aalst
― 8 min read
Formal Languages and Automata TheoryIntegrating Language Models for Better Communication
Thierry Petit, Arnault Pachot, Claire Conan-Vrinat
― 5 min read
Formal Languages and Automata TheoryUnderstanding Attractors in Complex Systems
Giann Karlo Aguirre Samboni, Stefan Haar, Loic Paulevé
― 6 min read
Machine LearningModeling Plant Growth with Stochastic L-Systems
Ali Lotfi, Ian McQuillan
― 5 min read
Formal Languages and Automata TheoryAn Overview of Tree Transducers in Computer Science
Lê Thành Dũng Nguyên
― 5 min read
Latest Articles
New techniques enhance offline learning for Regular Decision Processes in complex environments.
Ahana Deb, Roberto Cipollone, Anders Jonsson
― 5 min read
Discover the role of QuAK in assessing system performance and safety.
Marek Chalupa, Thomas A. Henzinger, Nicolas Mazzocchi
― 6 min read
Exploring the challenges of hybrid games and the synthesis problem.
Catalin Dima, Mariem Hammami, Youssouf Oualhadj
― 5 min read
A look into monitoring techniques for reliable real-time system performance.
Alessandro Cimatti, Thomas M. Grosen, Kim G. Larsen
― 5 min read
Analyzing the alignment of language models with traditional computational theories.
Jiří Wiedermann, Jan van Leeuwen
― 5 min read
New algorithm improves analysis of regular languages and their partitions.
Vladimir Podolskii, Victor Selivanov
― 5 min read
This article examines Watson-Crick automata and their role in analyzing circular DNA structures.
Benedek Nagy
― 4 min read
Explore the complexity of finite automata using translucent letters in language recognition.
František Mráz, Friedrich Otto
― 6 min read
An examination of comet languages and their significance in contextual grammars.
Marvin Ködding, Bianca Truthe
― 5 min read
Discover how non-global Parikh tree automata improve tree structure analysis.
Luisa Herrmann, Johannes Osterholzer
― 5 min read
This article examines how derivation trees help classify languages as metalinear or regular.
Martin Havel, Zbyněk Křivka, Alexander Meduna
― 4 min read
Alice and Bob compete to control states in a finite automaton.
Henning Fernau, Carolina Haase, Stefan Hoffmann
― 5 min read
A look into block languages and their significance in processing operations.
Guilherme Duarte, Nelma Moreira, Luca Prigioniero
― 5 min read
This article explores soliton automata and their role in chemical state transitions.
Henning Bordihn, Helena Schulz
― 5 min read
A look into graph languages and their role in processing complex information.
Yvo Ad Meeres
― 6 min read
New insights on the Skolem Problem for linear recurrence sequences of order four.
Piotr Bacik
― 5 min read
A look into two-dimensional pattern recognition systems and their applications.
Benjamin Hellouin de Menibus, Pacôme Perrotin
― 5 min read
An overview of string functions and their significance in computing.
Aliaume Lopez
― 5 min read
Exploring recent developments in automata learning and query techniques.
Kevin Zhou
― 6 min read
A new approach to help self-driving cars make safer decisions on the road.
Shuhao Qi, Zengjie Zhang, Zhiyong Sun
― 6 min read
This article discusses a new method for generating correctness proofs in Rust.
Chenyuan Yang, Xuheng Li, Md Rakib Hossain Misu
― 5 min read
This article discusses the Submonoid Membership problem in lamplighter groups and its implications.
Ruiwen Dong
― 7 min read
A new method for faster string query evaluation using MSO logic.
Pierre Bourhis, Florent Capelli, Stefan Mengel
― 4 min read
An overview of finite automata, focusing on states, transitions, and reachability.
David Fernando Casas Torres
― 4 min read
A new method enhances how robots plan and execute tasks effectively.
Xuan Lin, Jiming Ren, Samuel Coogan
― 5 min read
A framework for better understanding complex Markov chains using abstraction and sampling techniques.
Benoît Barbot, Patricia Bouyer, Serge Haddad
― 6 min read
Explore how Conway's cosmological theorem transforms number sequences through audioactive derivation.
Pierre Lairez, Aleksandr Storozhenko
― 5 min read
Exploring formal methods to ensure the reliability of quantum technologies.
Ittoop Vergheese Puthoor
― 5 min read
A look at how temporal logic shapes technology in our daily lives.
Shankara Narayanan Krishna, Khushraj Madnani, Agnipratim Nag
― 5 min read
Learn how synthetic data can enhance employee behavior analysis while protecting privacy.
Rakshitha Jayashankar, Mahesh Balan
― 5 min read
A look into Hybrid Rebeca and its role in smart system safety.
Saeed Zhiany, Fatemeh Ghassemi, Nesa Abbasimoghadam
― 5 min read
A guide to classifying configuration pairs and their behaviors.
Prince Mathew, Vincent Penelle, Prakash Saivasan
― 5 min read
Learn how database transactions ensure data consistency and efficiency.
Shabnam Ghasemirad, Christoph Sprenger, Si Liu
― 7 min read
Attributing harmful outputs from language models poses significant challenges and risks.
Manuel Cebrian, Jan Arne Telle
― 6 min read
This article discusses the importance of verifying quantum programs before deployment.
Yu-Fang Chen, Kai-Min Chung, Min-Hsiu Hsieh
― 7 min read
A new method simplifies understanding one-counter automata with fewer questions.
Prince Mathew, Vincent Penelle, A. V. Sreejith
― 6 min read
A look into the complexities of patterns and languages.
Dirk Nowotka, Max Wiedenhöft
― 7 min read
Learn how to create clear software models from complex code.
P. H. M. van Spaendonck
― 6 min read
A look at how messages are sent and received in technology.
Cinzia Di Giusto, Laetitia Laversa, Kirstin Peters
― 6 min read
A look into semi-conditional matrix grammars and their role in language generation.
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
― 5 min read