On Boolean closed full trios and rational Kripke frames
From MaRDI portal
Publication:2363961
DOI10.1007/s00224-016-9694-0zbMath1366.68155OpenAlexW2476870142MaRDI QIDQ2363961
Dietrich Kuske, Markus Lohrey, Georg Zetzsche
Publication date: 17 July 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4485/
Boolean operationsclosure propertiesregular languagesarithmetical hierarchyrational Kripke structuressynchronous rational transductionstrio operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronized rational relations of finite and infinite words
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The IO- and OI-hierarchies
- Transductions des langages de Chomsky
- Remarks on blind and partially blind one-way multicounter machines
- Refining the hierarchy of blind multicounter languages and twist-closed trios.
- Sequential grammars and automata with valences
- The monadic theory of morphic infinite words and generalizations
- Semigroup automata with rational initial and terminal sets
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- What makes some language theory problems undecidable
- Well-structured languages
- On Boolean closed full trios and rational Kripke frames.
- Graph Logics with Rational Relations and the Generalized Intersection Problem
- On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
- On Rational Trees
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- Symbolic Model Checking of Tense Logics on Rational Kripke Models
- An automata-theoretical characterization of the OI-hierarchy
- Very special languages and representations of recursively enumerable languages via computation histories
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- Simple Representations of Certain Classes of Languages
- Remarks on generalized Post Correspondence Problem
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Intersection-closed full AFL and the recursively enumerable languages
