scientific article
From MaRDI portal
Publication:3386623
DOI10.23638/DMTCS-22-4-3zbMath1477.68151arXiv1905.00559MaRDI QIDQ3386623
Joost Engelfriet, Heiko Vogler
Publication date: 5 January 2021
Full work available at URL: https://arxiv.org/abs/1905.00559
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (1)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronized rational relations of finite and infinite words
- Handbook of weighted automata
- Pushdown machines for the macro tree transducer
- The IO- and OI-hierarchies
- Iterated stack automata and complexity classes
- IO and OI. I
- IO and OI. II
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Weighted automata with storage
- Weighted automata and weighted logics
- Some definitional suggestions for automata theory
- Checking automata and one-way stack languages
- Principal AFL
- Tree acceptors and some of their applications
- A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem
- Homomorphic Characterizations of Indexed Languages
- Weighted Symbolic Automata with Data Storage
- A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
- Three Lectures on Automatic Structures
- On the definition of a family of automata
- Adding nesting structure to words
- Automata Presenting Structures: A Survey of the Finite String Case
- Formal Languages and Groups as Memory
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- Left and Right Synchronous Relations
- Theories of Automatic Structures and Their Complexity
- An automata-theoretical characterization of the OI-hierarchy
- Decision Problems of Finite Automata Design and Related Arithmetics
- MSO definable string transductions and two-way finite-state transducers
- Origin-equivalence of two-way word transducers is in PSPACE
- Transducers with Origin Information
- The tree width of auxiliary storage
- Generalized finite automata theory with an application to a decision problem of second-order logic
- One-way stack automata
- Nested Stack Automata
- Full AFLs and nested iterated substitution
- Studies in abstract families of languages
- Automata, Languages and Programming
This page was built for publication:
