FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2100182470> ?p ?o ?g. }

• W2100182470 abstract "This dissertation formalizes a comprehensive approach based on compiler technology [3-5] to simulate some basic forms of automata viz., finite accepters, finite transducers, pushdown accepters and Turing machines. These basic forms of automata are known for their simplicity and generality, hence widely studied and used in research. An Automata Description Language has been defined for modeling these basic forms of automata. The language has three sublanguages viz., descriptive sublanguage, pseudo-assembly sublanguage and procedural sublanguage, implementing three paradigms of programming. The sublanguages have the same scope and can be used to define any automata howsoever large and complex. The language supports both deterministic and nondeterministic forms of automata. In this language, an automaton may be composed of one or more submachines that may be developed even by a third party. All automata modeled in the Automata Description Language are required to be compiled before they can be simulated or their properties can be studied, hence the name of the approach. A reference compiler for the Automata Description Language has been developed. The compiler is a single-pass compiler comprising of lexical analysis, syntax analysis, semantic analysis and code generation phases, and bookkeeping and error handling modules. The compiler translates an automaton modeled in the Automata Description Language into an object program in an intermediate language, provided that the source program is correct. The same compiler can be used for all the three sublanguages of the Automata Description Language. The object program generated by the compiler can be simulated for any input string by a suitably developed simulator. The simulator starts from the initial configuration of the automaton and try to reach an accepting configuration following the rules specified by the object program. Nondeterminism has been implemented in the simulator using backtracking. Whenever the simulator finds multiple possible paths for simulation, it pushes all but one of them onto a stack. Alternatively, when the simulator finds no path ahead it pops off a configuration from the stack. The backtracking mechanism works internally and without concerning the user. A toolkit has been proposed and partially implemented to add utility to the Automata Description Language. The toolkit includes tools to analyze the properties of an automaton, convert one form of automata into another, minimize the number of internal states in an automaton, display a graphical representation of an automaton and generate the language accepted by an automaton. All these tools use the object programs generated by the compiler. Some example automata have been modeled in the Automata Description Language. The contents of their object programs were analyzed and the time required to compile and simulate them were also noted. It was observed that the descriptive sublanguage is best suited for modeling small and simple automata. Alternatively, the procedural sublanguage is the most efficient for large and complex automata followed by the pseudoassembly sublanguage. This study is expected to be helpful in further research on simulation of basic forms of automata and encourage the use of automata simulators in both academic and research environments. Additionally, the concepts used to implement nondeterminism in the Automata Description Language may also be used to develop nondeterministic general purpose procedural languages." @default.
• W2100182470 created "2016-06-24" @default.
• W2100182470 creator A5069331915 @default.
• W2100182470 date "2013-10-01" @default.
• W2100182470 modified "2023-09-25" @default.
• W2100182470 title "A compiler technology based approach to simulation of basic forms of automata" @default.
• W2100182470 cites W1522359191 @default.
• W2100182470 cites W1981154090 @default.
• W2100182470 cites W2030378470 @default.
• W2100182470 cites W2080924456 @default.
• W2100182470 cites W2150917454 @default.
• W2100182470 hasPublicationYear "2013" @default.
• W2100182470 type Work @default.
• W2100182470 sameAs 2100182470 @default.
• W2100182470 citedByCount "0" @default.
• W2100182470 crossrefType "journal-article" @default.
• W2100182470 hasAuthorship W2100182470A5069331915 @default.
• W2100182470 hasConcept C112505250 @default.
• W2100182470 hasConcept C169590947 @default.
• W2100182470 hasConcept C173608175 @default.
• W2100182470 hasConcept C199360897 @default.
• W2100182470 hasConcept C41008148 @default.
• W2100182470 hasConcept C80444323 @default.
• W2100182470 hasConcept C9957790 @default.
• W2100182470 hasConceptScore W2100182470C112505250 @default.
• W2100182470 hasConceptScore W2100182470C169590947 @default.
• W2100182470 hasConceptScore W2100182470C173608175 @default.
• W2100182470 hasConceptScore W2100182470C199360897 @default.
• W2100182470 hasConceptScore W2100182470C41008148 @default.
• W2100182470 hasConceptScore W2100182470C80444323 @default.
• W2100182470 hasConceptScore W2100182470C9957790 @default.
• W2100182470 hasLocation W21001824701 @default.
• W2100182470 hasOpenAccess W2100182470 @default.
• W2100182470 hasPrimaryLocation W21001824701 @default.
• W2100182470 hasRelatedWork W1497385637 @default.
• W2100182470 hasRelatedWork W1512248002 @default.
• W2100182470 hasRelatedWork W2004605222 @default.
• W2100182470 hasRelatedWork W2017260672 @default.
• W2100182470 hasRelatedWork W2078700326 @default.
• W2100182470 hasRelatedWork W2192862863 @default.
• W2100182470 hasRelatedWork W2369288331 @default.
• W2100182470 hasRelatedWork W2382501300 @default.
• W2100182470 hasRelatedWork W2522590477 @default.
• W2100182470 hasRelatedWork W2467097043 @default.
• W2100182470 isParatext "false" @default.
• W2100182470 isRetracted "false" @default.
• W2100182470 magId "2100182470" @default.
• W2100182470 workType "article" @default.