Iterated uniform finite-state transducers on unary languages
References
[1]
H. Bordihn, H. Fernau, M. Holzer, V. Manca, C. Martín-Vide, Iterated sequential transducers as language generating devices, Theor. Comput. Sci. 369 (2006) 67–81.
[2]
M. Chrobak, Finite automata and unary languages, Theor. Comput. Sci. 47 (1986) 149–158. Errata: [3].
[3]
M. Chrobak, Errata to “Finite automata and unary languages”, Theor. Comput. Sci. 302 (2003) 497–498.
[4]
C. Citrini, S. Crespi-Reghizzi, D. Mandrioli, On deterministic multi-pass analysis, SIAM J. Comput. 15 (1986) 668–693.
[5]
P.C. Fischer, Generation of primes by a one-dimensional real-time iterative array, J. ACM 12 (1965) 388–394.
[6]
N. Friburger, D. Maurel, Finite-state transducer cascades to extract named entities in texts, Theor. Comput. Sci. 313 (2004) 93–104.
[7]
A. Ginzburg, Algebraic Theory of Automata, Academic Press, 1968.
[8]
J. Hartmanis, Computational complexity of one-tape Turing machine computations, J. ACM 15 (1968) 325–339.
[9]
J. Hartmanis, R.E. Stearns, Algebraic Structure Theory of Sequential Machines, Prentice-Hall, 1966.
[10]
M. Holzer, M. Kutrib, Descriptional complexity—an introductory survey, in: C. Martín-Vide (Ed.), Scientific Applications of Language Methods, Imperial College Press, 2010, pp. 1–58.
[11]
M. Holzer, M. Kutrib, A. Malcher, Complexity of multi-head finite automata: origins and directions, Theor. Comput. Sci. 412 (2011) 83–96.
[12]
M. Kutrib, Cellular automata - A computational point of view, in: G.B. Enguix, M.D. Jiménez-López, C. Martín-Vide (Eds.), New Developments in Formal Languages and Applications, vol. 113, Springer, 2008, pp. 183–227,.
[13]
M. Kutrib, Cellular automata and language theory, in: R. Meyers (Ed.), Encyclopedia of Complexity and System Science, Springer, 2009, pp. 800–823,.
[14]
M. Kutrib, A. Malcher, Cellular automata with limited inter-cell bandwidth, Theor. Comput. Sci. 412 (2011) 3917–3931.
[15]
M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, Descriptional complexity of iterated uniform finite-state transducers, in: M. Hospodár, G. Jirásková, S. Konstantinidis (Eds.), Descriptional Complexity of Formal Systems (DCFS 2019), in: LNCS, vol. 11612, Springer, 2019, pp. 223–234.
[16]
M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion, in: G. Jirásková, G. Pighizzini (Eds.), Descriptional Complexity of Formal Systems (DCFS 2020), in: LNCS, vol. 12442, Springer, 2020, pp. 117–129.
[17]
M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, Iterated uniform finite-state transducers on unary languages, in: T. Bures, R. Dondi, J. Gamper, G. Guerrini, T. Jurdzinski, C. Pahl, F. Sikora, P.W.H. Wong (Eds.), Theory and Practice of Computer Science (SOFSEM 2021), in: LNCS, vol. 12607, Springer, 2021, pp. 218–232.
[18]
M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, Computational and descriptional power of nondeterministic iterated uniform finite-state transducers, Fundam. Inform. 185 (2022) 337–356,.
[19]
M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, Descriptional complexity of iterated uniform finite-state transducers, Inf. Comput. 284 (2022),.
[20]
M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion, J. Autom. Lang. Comb. (2023) in press.
[21]
V. Manca, On the generative power of iterated transductions, in: M. Ito, G. Păun, S. Yu (Eds.), Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin, World Scientific, 2001, pp. 315–327.
[22]
J. Mazoyer, V. Terrier, Signals in one-dimensional cellular automata, Theor. Comput. Sci. 217 (1999) 53–80.
[23]
G.H. Mealy, A method for synthesizing sequential circuits, Bell Syst. Tech. J. 34 (1955) 1045–1079.
[24]
C. Mereghetti, Testing the descriptional power of small Turing machines on nonregular language acceptance, Int. J. Found. Comput. Sci. 19 (2008) 827–843.
[25]
C. Mereghetti, B. Palano, G. Pighizzini, Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata, RAIRO Inform. Théor. 35 (2001) 477–490.
[26]
C. Mereghetti, G. Pighizzini, Two-way automata simulations and unary languages, J. Autom. Lang. Comb. 5 (2000) 287–300.
[27]
C. Mereghetti, G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput. 30 (2001) 1976–1992.
[28]
M.L. Minsky, Recursive unsolvability of Post's problem of ‘tag’ and other topics in the theory of Turing machines, Ann. Math. 74 (1961) 437–455.
[29]
G. Pighizzini, Nondeterministic one-tape off-line Turing machines and their time complexity, J. Autom. Lang. Comb. 14 (2009) 107–124.
[30]
H. Umeo, N. Kamikawa, A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications, Fundam. Inform. 52 (2002) 257–275.
[31]
H. Umeo, N. Kamikawa, Real-time generation of primes by a 1-bit-communication cellular automaton, Fundam. Inform. 58 (2003) 421–435.
Index Terms
- Iterated uniform finite-state transducers on unary languages
Index terms have been assigned to the content through auto-classification.
Recommendations
Iterated Uniform Finite-State Transducers on Unary Languages
SOFSEM 2021: Theory and Practice of Computer ScienceAbstractWe consider the model of an iterated uniform finite-state transducer, which executes the same length-preserving transduction in iterative sweeps. The first sweep takes place on the input string, while any subsequent sweep works on the output of ...
Unambiguous finite automata over a unary alphabet
Nondeterministic finite automata (NFA) with at most one accepting computation on every input string are known as unambiguous finite automata (UFA). This paper considers UFAs over a one-letter alphabet, and determines the exact number of states in DFAs ...
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
An iterated uniform finite-state transducer (IUFST) runs the same length-preserving transduction, starting with a sweep on the input string and then iteratively sweeping on the output of the previous sweep. The IUFST accepts the input string by halting in ...
Comments
Information & Contributors
Information
Published In
The Authors.
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Published: 21 August 2023
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in