On the complexity of decision problems for parameterized finite state synchronous transducers
From MaRDI portal
Publication:6666811
DOI10.1007/978-3-031-71112-1_24MaRDI QIDQ6666811
Vladimir A. Zakharov, Tianxiang Tang
Publication date: 20 January 2025
Cites Work
- Title not available (Why is that?)
- Parametrized automata simulation and application to service composition
- Descriptional and computational complexity of finite automata -- a survey
- The parallel complexity of finite-state automata problems
- Deciding bisimilarity is P-complete
- Space-bounded reducibility among combinatorial problems
- Finite-memory automata
- Finite-state unification automata and relational languages
- Parameterized regular expressions and their languages
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
- Steering, Entanglement, Nonlocality, and the Einstein-Podolsky-Rosen Paradox
- Variable Automata over Infinite Alphabets
- An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
- Parametric real-time reasoning
This page was built for publication: On the complexity of decision problems for parameterized finite state synchronous transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666811)
