Pages that link to "Item:Q2529464"

The following pages link to Some definitional suggestions for automata theory (Q2529464):

Displaying 43 items.

• A survey of state vectors (Q458456) (← links)
• Look-ahead on pushdowns (Q579952) (← links)
• Insertion languages (Q796994) (← links)
• Extended macro grammars and stack controlled machines (Q1064075) (← links)
• On coordinated selective substitutions: Towards a unified theory of grammars and machines (Q1081311) (← links)
• Pushdown machines for the macro tree transducer (Q1089810) (← links)
• High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
• Division in idealized unit cost RAMs (Q1159982) (← links)
• Ein Modell des P=NP-Problems mit einer positiven Lösung (Q1170237) (← links)
• Iterated stack automata and complexity classes (Q1183602) (← links)
• \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
• Fuzzy and probabilistic programs (Q1229093) (← links)
• Max-product grammars and languages (Q1229591) (← links)
• Dispositions, realism, and explanation (Q1239305) (← links)
• On transformations of programs (Q1393935) (← links)
• Automata over continuous time (Q1399970) (← links)
• Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
• Linear weighted tree automata with storage and inverse linear tree homomorphisms (Q2051842) (← links)
• Principal abstract families of weighted tree languages (Q2064529) (← links)
• Weighted automata with storage (Q2280328) (← links)
• Weighted iterated linear control (Q2422779) (← links)
• Matrix Code (Q2441509) (← links)
• Storage products and linear control of derivations (Q2480751) (← links)
• Subrecursive programming languages. II. On program size (Q2546770) (← links)
• Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.) (Q2549682) (← links)
• An Automata Characterisation for Multiple Context-Free Languages (Q2817383) (← links)
• Weighted Symbolic Automata with Data Storage (Q2817389) (← links)
• (Q3384165) (← links)
• (Q3386623) (← links)
• Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
• Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
• A Programming Language for the Interval Geometric Machine (Q4924536) (← links)
• On the Complexity of Infinite Advice Strings (Q5002808) (← links)
• From finite automata toward hybrid systems (Extended abstract) (Q5055953) (← links)
• Register Transducers Are Marble Transducers (Q5089194) (← links)
• (Q5092330) (← links)
• The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
• From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
• Algorithmic properties of structures (Q5600863) (← links)
• Stackautomaten in Labyrinthen (Q5642544) (← links)
• Computability by Probabilistic Turing Machines (Q5658085) (← links)
• Jede mit Stackautomaten berechenbare Funktion ist elementar (Q5668457) (← links)
• Abstract families of relations (Q5904504) (← links)