FRINK Linked Data Fragments server

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

• W4210243036 endingPage "701" @default.
• W4210243036 startingPage "670" @default.
• W4210243036 abstract "Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of finite-state automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode. The computations of these three types of automata show many common features, and it is surprising that the methods for analyzing the behavior of automata developed for one of these models do not find suitable utilization in other models. The goal of this paper is to develop a uniform technique for building polynomial-time equivalence checking algorithms for some classes of automata (finite transducers, two-tape automata, biautomata, and single-state pushdown automata) which exhibit certain features of the deterministic or unambiguous behavior. This new technique reduces the equivalence checking of automata to solvability checking of certain systems of equations over the semirings of languages or transductions. It turns out that such a checking can be performed by the variable elimination technique which relies on some combinatorial and algebraic properties of prefix-free regular languages. The main results obtained in this paper are as follows: 1. Using the algebraic approach a new algorithm for checking the equivalence of states of deterministic finite automata is constructed; time complexity of this algorithm is $$O(n;text{log};n)$$ . 2. A new class of prefix-free finite transducers is distinguished and it is shown that the developed algebraic approach provides the equivalence checking of transducers from this class in quadratic time (for real-time prefix-free transducers) and cubic time (for prefix-free transducers with $$varepsilon $$ -transitions) relative to the size of analyzed machines. 3. It is shown that the equivalence problem for deterministic two-tape finite automata can be reduced to the same problem for prefix-free finite transducers and solved in cubic time relative to the size of the analyzed machines. 4. In the same way it is proved that the equivalence problem for deterministic finite biautomata can be solved in cubic time relative to the size of analyzed machines. 5. By means of the developed approach an efficient equivalence checking algorithm for the class of simple grammars corresponding to deterministic single-state pushdown automata is constructed." @default.
• W4210243036 created "2022-02-08" @default.
• W4210243036 creator A5062447638 @default.
• W4210243036 date "2021-12-01" @default.
• W4210243036 modified "2023-10-16" @default.
• W4210243036 title "Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines" @default.
• W4210243036 cites W136524193 @default.
• W4210243036 cites W1483448012 @default.
• W4210243036 cites W1512065894 @default.
• W4210243036 cites W1518704718 @default.
• W4210243036 cites W1534681217 @default.
• W4210243036 cites W1537698696 @default.
• W4210243036 cites W1539922307 @default.
• W4210243036 cites W1560909590 @default.
• W4210243036 cites W1562252540 @default.
• W4210243036 cites W1566080944 @default.
• W4210243036 cites W1596143700 @default.
• W4210243036 cites W1601428698 @default.
• W4210243036 cites W1795386943 @default.
• W4210243036 cites W1966515438 @default.
• W4210243036 cites W1969807610 @default.
• W4210243036 cites W1981523035 @default.
• W4210243036 cites W1986635205 @default.
• W4210243036 cites W1992292825 @default.
• W4210243036 cites W2005456631 @default.
• W4210243036 cites W2006777369 @default.
• W4210243036 cites W2008650192 @default.
• W4210243036 cites W2010927194 @default.
• W4210243036 cites W2011523226 @default.
• W4210243036 cites W2011725207 @default.
• W4210243036 cites W2013714680 @default.
• W4210243036 cites W2023090947 @default.
• W4210243036 cites W2024987067 @default.
• W4210243036 cites W2030798439 @default.
• W4210243036 cites W2034209817 @default.
• W4210243036 cites W2041168146 @default.
• W4210243036 cites W2042113833 @default.
• W4210243036 cites W2043268408 @default.
• W4210243036 cites W2048217963 @default.
• W4210243036 cites W2049481601 @default.
• W4210243036 cites W2051521505 @default.
• W4210243036 cites W2054125504 @default.
• W4210243036 cites W2059683551 @default.
• W4210243036 cites W2061054158 @default.
• W4210243036 cites W2064776283 @default.
• W4210243036 cites W2066201500 @default.
• W4210243036 cites W2078050093 @default.
• W4210243036 cites W2088459913 @default.
• W4210243036 cites W2089236668 @default.
• W4210243036 cites W2096207507 @default.
• W4210243036 cites W2100590693 @default.
• W4210243036 cites W2109548990 @default.
• W4210243036 cites W2111270089 @default.
• W4210243036 cites W2113722134 @default.
• W4210243036 cites W2115082275 @default.
• W4210243036 cites W2135734455 @default.
• W4210243036 cites W2170953202 @default.
• W4210243036 cites W2173721792 @default.
• W4210243036 cites W2228938473 @default.
• W4210243036 cites W2261362537 @default.
• W4210243036 cites W2545845195 @default.
• W4210243036 cites W2558286691 @default.
• W4210243036 cites W2796510948 @default.
• W4210243036 cites W2911875747 @default.
• W4210243036 cites W4212777194 @default.
• W4210243036 cites W4242157899 @default.
• W4210243036 cites W4251691259 @default.
• W4210243036 cites W6269405 @default.
• W4210243036 doi "https://doi.org/10.3103/s014641162107018x" @default.
• W4210243036 hasPublicationYear "2021" @default.
• W4210243036 type Work @default.
• W4210243036 citedByCount "0" @default.
• W4210243036 crossrefType "journal-article" @default.
• W4210243036 hasAuthorship W4210243036A5062447638 @default.
• W4210243036 hasBestOaLocation W42102430362 @default.
• W4210243036 hasConcept C104091681 @default.
• W4210243036 hasConcept C110251889 @default.
• W4210243036 hasConcept C112505250 @default.
• W4210243036 hasConcept C11413529 @default.
• W4210243036 hasConcept C118615104 @default.
• W4210243036 hasConcept C134306372 @default.
• W4210243036 hasConcept C138885662 @default.
• W4210243036 hasConcept C141603448 @default.
• W4210243036 hasConcept C167822520 @default.
• W4210243036 hasConcept C194525867 @default.
• W4210243036 hasConcept C2779782106 @default.
• W4210243036 hasConcept C2780069185 @default.
• W4210243036 hasConcept C33923547 @default.
• W4210243036 hasConcept C41008148 @default.
• W4210243036 hasConcept C41895202 @default.
• W4210243036 hasConcept C52370388 @default.
• W4210243036 hasConcept C77944639 @default.
• W4210243036 hasConcept C80444323 @default.
• W4210243036 hasConcept C9376300 @default.
• W4210243036 hasConceptScore W4210243036C104091681 @default.
• W4210243036 hasConceptScore W4210243036C110251889 @default.
• W4210243036 hasConceptScore W4210243036C112505250 @default.
• W4210243036 hasConceptScore W4210243036C11413529 @default.

• next