Injection Structures Specified by Finite State Transducers
DOI10.1007/978-3-319-50062-1_24zbMATH Open1485.03108OpenAlexW2559451524MaRDI QIDQ2970970FDOQ2970970
Douglas Cenzer, Jeffrey Remmel, Samuel R. Buss, Mia Minnes
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_24
automatic structurescomputability theoryfinite state automatafinite state transducersinjection structures
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Computable structure theory, computable model theory (03C57)
Cites Work
- Title not available (Why is that?)
- On direct products of automaton decidable theories
- Automaticity of ordinals and of homogeneous graphs
- Automatic linear orders and trees
- STACS 2004
- Automatic Structures: Richness and Limitations
- Logical Reversibility of Computation
- Computable structures and the hyperarithmetical hierarchy
- Computability-theoretic properties of injection structures
- Effective Categoricity of Injection Structures
- Unary Automatic Graphs: An Algorithmic Perspective
Cited In (4)
Recommendations
- Finite state transducers with predicates and identities 👍 👎
- On injectivity of deterministic top-down tree transducers 👍 👎
- Inference of finite-state transducers from regular languages 👍 👎
- Injective envelopes of transition systems and Ferrers languages 👍 👎
- Complexity and categoricity of injection structures induced by finite state transducers 👍 👎
- Complexity of injection structures induced by finite state transducers 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Injection Structures Specified by Finite State Transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970970)
