Abstract
Sequences of numbers (either natural integers, or integers or rational) of level have been defined in [FS06] as the sequences which can be computed by deterministic pushdown automata of level k. We extend this definition to sequences of words indexed by words. We give characterisations of these sequences in terms of “higher-order” L-systems. In particular sequences of rational numbers of level 3 are characterised by polynomial recurrences (which generalize the P-recurrent sequences studied in [Sta80]). The equality problem for sequences of rational numbers of level 3 is shown decidable.KeywordsIterated pushdown automatarecurrent sequences equivalence problems
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
