Results 211 to 220 of about 129,017 (253)

On some transducer equivalence problems for families of languages

, 1988
We try to present a systematic treatment of equivalence problems concerning deterministic generalized sequential machines (gsm), functional transducers and deterministic transducers as well as compositions of functional transducer mappings, especially ...
P. Turakainen
semanticscholar   +1 more source

Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"

Foundations of Software Technology and Theoretical Computer Science, 2018
In the past decades, classical results from algebra, including Hilbert's Basis Theorem, had various applications in formal languages, including a proof of the Ehrenfeucht Conjecture, decidability of HDT0L sequence equivalence, and decidability of the ...
Adrien Boiret, Radoslaw Piórkowski, J. Schmude   +2 more
semanticscholar   +1 more source

Formal Verification of Digital Circuits Using Simulator with Mathematical Foundation

Applied Mechanics and Materials, 2019
To ease hardware design process, circuits are normally designed in description languages such as Verilog and VHDL. The correctness of circuits is normally checked by exhaustive simulation in simulators such as Icarus and VCS.
Wilayat Khan, Basim Azam, Noman Shahid, Abdul Moeed Khan, Ahtisham Shaheen   +4 more
semanticscholar   +1 more source

Shift and Equivalence of Noun Phrases in English-Indonesian Translation of Barbie Short Stories

, 2017
Process of translating noun phrases from English into Indonesian causes a translator has a difficulty in determining structure of noun phrase in target language because of the different structure between both languages.
Sri Nikmatu Rupiah, Rudi Hartono
semanticscholar   +1 more source

Automatic equivalence checking for SystemC-TLM 2.0 models against their formal specifications

Design, Automation and Test in Europe, 2017
Mehran Goli, Jannis Stoppe, R. Drechsler
semanticscholar   +1 more source

Formal languages and power series

Symposium on the Theory of Computing, 1971
D. Stanat
semanticscholar   +1 more source

Equivalence of C_{emptystack} and C_{finalstate} in Acceptance of Pushdown Automata Languages: A Formal Proof

2023
openaire   +1 more source

Decidability of the equivalence problem of finitely ambiguous finance automata(Semigroups, Formal Languages and Computer Systems)

, 1996
Kosaburo Hashiguchi, Kenichi Ishiguro
openalex   +1 more source

On formal languages in one-dimensional dynamical systems

, 1993
Huimin Xie
semanticscholar   +1 more source

Topologies on formal languages

Mathematical Systems Theory, 1975
H. Walter
semanticscholar   +1 more source