:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Khoussainov, Bakhadyr, Takisaka, Toru
Format:	Preprint
Published:	2019
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/1908.03800
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quasi-Isometric Reductions Between Infinite Strings
by: Celine, Karen Frilya, et al.
Published: (2024)

Automatic constraint satisfaction problem
by: Bulatov, Andrei, et al.
Published: (2026)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
by: Filiot, Emmanuel, et al.
Published: (2021)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

FC-Datalog as a Framework for Efficient String Querying
by: Bell, Owen M., et al.
Published: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
by: Aminof, Benjamin, et al.
Published: (2024)

sweap: Reactive Synthesis for Infinite-State Integer Problems
by: Azzopardi, Shaun, et al.
Published: (2026)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
by: Carette, Titouan, et al.
Published: (2025)

A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)

Online Monitoring of Metric Temporal Logic using Sequential Networks
by: Ulus, Dogan
Published: (2019)

A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

Unreliability in Practical Subclasses of Communicating Systems
by: Suresh, Amrita, et al.
Published: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)

Positive Hennessy-Milner Logic for Branching Bisimulation
by: Geuvers, Herman, et al.
Published: (2022)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2026)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2024)

Simple grammar bisimilarity, with an application to session type equivalence
by: Poças, Diogo, et al.
Published: (2024)

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)